Picture 1 of 1
Stock photo
Picture 1 of 1
Stock photo
Algorithmic Graph Theory by Alan Gibbons (1985, Trade Paperback)
Bargain Book Stores (1129426)
99.2% positive Feedback
Price:
US $73.01
Approximately£54.51
+ $15.45 postage
Returns:
30 days return. Buyer pays for return postage. If you use an eBay delivery label, it will be deducted from your refund amount.
Condition:
Format: Paperback or Softback. Your Privacy. Condition Guide. Item Availability.
- Buy it nowAlgorithmic Graph Theory (Paperback or Softback)
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
About this product
Product Identifiers
PublisherCambridge University Press
ISBN-100521288819
ISBN-139780521288811
eBay Product ID (ePID)564417
Product Key Features
Number of Pages272 Pages
LanguageEnglish
Publication NameAlgorithmic Graph Theory
Publication Year1985
SubjectGraphic Methods, General, Algebra / General
TypeTextbook
Subject AreaMathematics, Computers
AuthorAlan Gibbons
FormatTrade Paperback
Dimensions
Item Height0.7 in
Item Weight14.8 Oz
Item Length9.1 in
Item Width6.1 in
Additional Product Features
Intended AudienceCollege Audience
LCCN84-023835
Dewey Edition19
Reviews'… this is a stimulating book for those who want to learn some basic algorithms of graph theory and who already know where to apply them … nice and thorough introduction.' European Journal of Operational Research, '... this is a stimulating book for those who want to learn some basic algorithms of graph theory and who already know where to apply them ... nice and thorough introduction.'European Journal of Operational Research, '... this is a stimulating book for those who want to learn some basic algorithms of graph theory and who already know where to apply them ... nice and thorough introduction.' European Journal of Operational Research, '... the book covers a relatively large part of algorithmic graph theory. The theory presented is well motivated. I can conclude that the textbook is well written and for those interested in learning algorithmic graph theory, this is s good introduction.' Zentralblatt f8r Mathematik und ihre Grenzgebiete, '¿ the book covers a relatively large part of algorithmic graph theory. The theory presented is well motivated. I can conclude that the textbook is well written and for those interested in learning algorithmic graph theory, this is s good introduction.¿ Zentralblatt für Mathematik und ihre Grenzgebiete, '… the book covers a relatively large part of algorithmic graph theory. The theory presented is well motivated. I can conclude that the textbook is well written and for those interested in learning algorithmic graph theory, this is s good introduction.'Zentralblatt für Mathematik und ihre Grenzgebiete, '… this is a stimulating book for those who want to learn some basic algorithms of graph theory and who already know where to apply them … nice and thorough introduction.'European Journal of Operational Research, '… the book covers a relatively large part of algorithmic graph theory. The theory presented is well motivated. I can conclude that the textbook is well written and for those interested in learning algorithmic graph theory, this is s good introduction.' Zentralblatt fr Mathematik und ihre Grenzgebiete, '... the book covers a relatively large part of algorithmic graph theory. The theory presented is well motivated. I can conclude that the textbook is well written and for those interested in learning algorithmic graph theory, this is s good introduction.'Zentralblatt für Mathematik und ihre Grenzgebiete
IllustratedYes
Dewey Decimal511.5
Table Of ContentPreface; 1. Introducing graphs and algorithmic complexity; 2. Spanning-trees, branchings and connectivity; 3. Planar graphs; 4. Networks and flows; 5. Matchings; 6. Eulerian and Hamiltonian tours; 7. Colouring graphs; 8. Graph problems and intractability; Appendix; Author Index; Subject Index.
SynopsisAlgorithm Graph Theory introduces most of the classical concepts of pure and applied graph theory (spanning trees, connectivity, genus, colourability, flows in networks, matching and transversals) and covers many of the classical theorems. Its emphasis is on algorithms and their complexity ñ which graph problems have known efficient solutions and which are intractable., This is a textbook on graph theory, especially suitable for computer scientists but also suitable for mathematicians with an interest in computational complexity. Although it introduces most of the classical concepts of pure and applied graph theory (spanning trees, connectivity, genus, colourability, flows in networks, matchings and traversals) and covers many of the major classical theorems, the emphasis is on algorithms and thier complexity: which graph problems have known efficient solutions and which are intractable. For the intractable problems a number of efficient approximation algorithms are included with known performance bounds. Informal use is made of a PASCAL-like programming language to describe the algorithms. A number of exercises and outlines of solutions are included to extend and motivate the material of the text., An introduction to pure and applied graph theory with an emphasis on algorithms and their complexity., This is a textbook on graph theory, especially suitable for computer scientists but also suitable for mathematicians with an interest in computational complexity. Although it introduces most of the classical concepts of pure and applied graph theory (spanning trees, connectivity, genus, colourability, flows in networks, matchings and traversals) and covers many of the major classical theorems, the emphasis is on algorithms and their complexity: which graph problems have known efficient solutions and which are intractable. For the intractable problems a number of efficient approximation algorithms are included with known performance bounds. Informal use is made of a PASCAL-like programming language to describe the algorithms. A number of exercises and outlines of solutions are included to extend and motivate the material of the text.
LC Classification NumberQA166 .G53 1985
All listings for this product
Be the first to write a review
