Allurement of Some Graph Algorithms,Used

Allurement of Some Graph Algorithms,Used

In Stock
SKU: DADAX3848427389
Brand: LAP Lambert Academic Publishing
Sale price$82.28 Regular price$117.54
Save $35.26
Quantity
Add to wishlist
Add to compare

Processing time: 1-3 days

US Orders Ships in: 3-5 days

International Orders Ships in: 8-12 days

Return Policy: 15-days return on defective items

Payment Option
Payment Methods

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

The last five decades have witnessed an upsurge of interest and activity in graph theory, particularly among mathematicians and engineers. It has recently emerged as a subject in its own right, as well as being an important mathematical tool in such diverse subjects as operational research, computer science, networking, mobile computing, sociology and many other fields. This book is devoted entirely to computational aspects of graph theory, including graphtheoretic algorithms. The book provide some new algorithms of graph theory such as generation all spanning trees, minimal spanning tree generation, graph colouring algorithm, importance of some special graphs in networking, hiding information and applications of graphs in different areas. The book is useful for graduate and post graduate students of science and engineering and new research scholar to motivate them in the field of graph theory.

⚠️ WARNING (California Proposition 65):

This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.

For more information, please visit www.P65Warnings.ca.gov.

Recently Viewed