Graphs Theory and Applications
Home > Mathematics and Science Textbooks > Mathematics > Combinatorics and graph theory > Graphs Theory and Applications: With Exercises and Problems
Graphs Theory and Applications: With Exercises and Problems

Graphs Theory and Applications: With Exercises and Problems


     0     
5
4
3
2
1



International Edition


X
About the Book

This book provides a comprehensive and pedagogical introduction to graph theory and its applications. It contains all the standard basic material and develops significant topics and applications, such as: colorings and the timetabling problem, matchings and the optimal assignment problem, and Hamiltonian cycles and the travelling salesman problem, to name but a few. Exercises at various levels are given at the end of each chapter, and a final chapter presents a few general problems with hints for solutions, thus providing the reader with the opportunity to test and refine their knowledge on the subject. An appendix outlines the basis of computational complexity theory, in particular the definition of NP-completeness, which is essential for algorithmic applications.

Table of Contents:
Introduction 17 Chapter 1. Basic Concepts 21 1.1 The origin of the graph concept 21 1.2 Definition of graphs 24 1.3 Subgraphs 28 1.4 Paths and cycles 29 1.5 Degrees 33 1.6 Connectedness 35 1.7 Bipartite graphs 36 1.8 Algorithmic aspects 37 1.9 Exercises 41 Chapter 2. Trees 45 2.1 Definitions and properties 45 2.2 Spanning trees 49 2.3 Application: minimum spanning tree problem 54 2.4 Connectivity 59 2.5 Exercises 66 Chapter 3. Colorings 71 3.1 Coloring problems 71 3.2 Edge coloring 71 3.3 Algorithmic aspects 73 3.4 The timetabling problem 75 3.5 Exercises 81 Chapter 4. Directed Graphs 83 4.1 Definitions and basic concepts 83 4.2 Acyclic digraphs 90 4.3 Arborescences 92 4.4 Exercises 95 Chapter 5. Search Algorithms 97 5.1 Depth-first search of an arborescence 97 5.2 Optimization of a sequence of decisions 103 5.3 Depth-first search of a digraph 109 5.4 Exercises 117 Chapter 6. Optimal Paths 119 6.1 Distances and shortest paths problems 119 6.2 Case of non-weighted digraphs: breadth-first search 120 6.3 Digraphs without circuits 125 6.4 Application to scheduling 128 6.5 Positive lengths 134 6.6 Other cases 142 6.7 Exercises 143 Chapter 7. Matchings 149 7.1 Matchings and alternating paths 149 7.2 Matchings in bipartite graphs 152 7.3 Assignment problem 156 7.4 Optimal assignment problem 164 7.5 Exercises 171 Chapter 8. Flows 173 8.1 Flows in transportation networks 173 8.2 The max-flow min-cut theorem 177 8.3 Maximum flow algorithm 180 8.4 Flow with stocks and demands 188 8.5 Revisiting theorems 191 8.6 Exercises 194 Chapter 9. Euler Tours 197 9.1 Euler trails and tours 197 9.2 Algorithms 201 9.3 The Chinese postman problem 207 9.4 Exercises 212 Chapter 10. Hamilton Cycles 215 10.1 Hamilton cycles 215 10.2 The traveling salesman problem 218 10.3 Approximation of a difficult problem 220 10.4 Approximation of themetric TSP 223 10.5 Exercises 234 Chapter 11. Planar Representations 237 11.1 Planar graphs 237 11.2 Other graph representations 242 11.3 Exercises 244 Chapter 12. Problems with Comments 247 12.1 Problem 1: A proof of k-connectivity 247 12.2 Problem2: An application to compiler theory 249 12.3 Problem3: Kernel of a digraph 251 12.4 Problem 4: Perfect matching in a regular bipartite graph 253 12.5 Problem5: Birkhoff-Von Neumann’s theorem 254 12.6 Problem 6: Matchings and tilings 256 12.7 Problem7: Strip mining 258 Appendix A. Expression of Algorithms 261 Appendix B. Bases of Complexity Theory 267 Bibliography 277 Index 279

About the Author :
Jean-Claude Fournier is Professor at the University of Paris 12, France, and is a member of the Unite Mixte de Recherche Combinatoire et Optimisation (University of Paris 6 and CNRS) founded by Claude Berge.


Best Sellers


Product Details
  • ISBN-13: 9781848210707
  • Publisher: ISTE Ltd and John Wiley & Sons Inc
  • Publisher Imprint: ISTE Ltd and John Wiley & Sons Inc
  • Height: 239 mm
  • No of Pages: 284
  • Returnable: N
  • Sub Title: With Exercises and Problems
  • Width: 163 mm
  • ISBN-10: 1848210701
  • Publisher Date: 03 Feb 2009
  • Binding: Hardback
  • Language: English
  • Returnable: N
  • Spine Width: 2 mm
  • Weight: 549 gr


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Graphs Theory and Applications: With Exercises and Problems
ISTE Ltd and John Wiley & Sons Inc -
Graphs Theory and Applications: With Exercises and Problems
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Graphs Theory and Applications: With Exercises and Problems

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!