BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

DISCRETE MATHEMATICS : GRAPH ALGORITHMS, ALGEBRAIC STRUCTURES, CODING THEORY, AND CRYPTOGRAPHY, 1ST EDITION

DISCRETE MATHEMATICS : GRAPH ALGORITHMS, ALGEBRAIC STRUCTURES, CODING THEORY, AND CRYPTOGRAPHY, 1ST EDITION

DISCRETE MATHEMATICS : GRAPH ALGORITHMS, ALGEBRAIC STRUCTURES, CODING THEORY,
Stock photo: cover may vary

DISCRETE MATHEMATICS : GRAPH ALGORITHMS, ALGEBRAIC STRUCTURES, CODING THEORY, AND CRYPTOGRAPHY, 1ST EDITION Hardback -

by SRIRAMAN SRIDHARAN, R. BALAKRISHNAN

Add to wish list
  • New
New

Description

USA Edition . New. Brand New! Fast Delivery US Edition and ship within 24-48 hours. Deliver by FedEx and Dhl, & Aramex, UPS, & USPS and we do accept APO and PO BOX Addresses. Order can be delivered worldwide within 7-12 days and we do have flat rate for up to 2LB. Extra shipping charges will be requested if the Book weight is more than 5 LB. This Item May be shipped from India, United states & United Kingdom. Depending on your location and availability.
Ask the seller a question Add to wish list
A$366.75
A$12.18 Delivery to USA
Standard delivery: 5 to 10 days
More delivery options
Ships from XLANCEBOOKS L.L.C. (India)
The BIBLIO Guarantee

Details

About XLANCEBOOKS L.L.C. India

Biblio member since 2022

USA EDITION, 30 day return guarantee,

Terms of Sale: 30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from XLANCEBOOKS L.L.C.

Reader reviews for DISCRETE MATHEMATICS : GRAPH ALGORITHMS, ALGEBRAIC STRUCTURES, CODING THEORY, AND CRYPTOGRAPHY, 1ST EDITION

Write a review for this book

There are no reviews for this book yet. Be the first to write a review!

Your review will be anonymous unless you login or create an account first.

Overall rating
Remember: You’re rating the book as a work, not the seller or the condition of the specific copy you purchased!

Important Terms and Guidelines

  • Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
  • Reviews must be at least 140 characters in length.
  • Please do not reveal critical plot elements.
  • This is not a help line. Contact customer support if you need help.
Your review must not include:
  • Obscenities, discriminatory language, or other insulting language not suitable for public domain
  • Advertisements, “spam” content, or references to other products, offers or websites.
  • Email addresses, URLs, phone numbers, physical addresses or other contact information.
  • Overly critical comments about other reviews or reviewers
  • Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
  • Availability, price, or alternative ordering/shipping information

From the publisher

Conveying ideas in a user-friendly style, this book has been designed for a course in Applied Algebra. The book covers graph algorithms, basic algebraic structures, coding theory and cryptography. It will be most suited for senior undergraduates and beginning graduate students in mathematics and computer science as also to
individuals who want to have a knowledge of the below-mentioned topics.

  • Provides a complete discussion on several graph algorithms such as Prims algorithm and Kruskals algorithm for sending a minimum cost spanning tree in a weighted graph, Dijkstras single source shortest path algorithm, Floyds algorithm, Warshalls algorithm, Kuhn-Munkres Algorithm. In addition to DFS and BFS search, several applications of DFS and BFS are also discussed.
  • Presents a good introduction to the basic algebraic structures, namely, matrices, groups, rings, fields including finite fields as also a discussion on vector spaces and linear equations and their solutions.
  • Provides an introduction to linear codes including cyclic codes.

Presents a description of private key cryptosystems as also a discussion on public key cryptosystems such as RSA, ElGamal and Miller-Rabin. Finally, the Agrawal-KayalSaxena algorithm (AKS Algorithm) for testing if a given
positive integer is prime or not in polynomial time is presented- the first time in a textbook.

Two distinguished features of the book are:

  • Illustrative examples have been presented throughout the book to make the readers appreciate the concepts described.
  • Answers to all even-numbered exercises in all the chapters are given.

Please wait a moment while we load the requested page.

tracking-