Computational Graph Theory (73 results)

Condition: good. Hardcover Book.

Condition: As New. Like New condition. A near perfect copy that may have very minor cosmetic defects.

Hardcover. Condition: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less.

Hardcover. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority.

Condition: Good. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Condition: Very Good. Former library copy. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Hardcover. Condition: new. New Copy. Customer Service Guaranteed.

Paperback. Condition: New. Brand new book, sourced directly from publisher. Dispatch time is 24-48 hours from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.

hardcover. Condition: fine. Illustrated with graphs throughout. 480 pages. Small, square 4to, glossy pictorial boards. Cambridge: Cambridge University Press, (2003). A fine copy-- some minor scuffing. In addition to being a research tool, Combinatorica makes discrete mathematics accessible in new and exciting ways, by encouraging computational experimentation and visualization. The book is suitable for self-study and as a primary or supplementary text book for discrete mathematics courses.…

Condition: As New. Like New condition. A near perfect copy that may have very minor cosmetic defects.

Condition: Gut. Reprinted. 480 S. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. 9780521806862 Sprache: Englisch Gewicht in Gramm: 990.

Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

Condition: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Taschenbuch. Condition: Neu. Neuware -Martin Charles Golumbic has been making seminal contributions to algorithmic graph theory and artificial intelligence throughout his career. He is universally admired as a long-standing pillar of the discipline of computer science. He has contributed to the development of fundamental research in artificial intelligence in the area of complexity and spatial-temporal reasoning as well as in the area of compiler optimization. Golumbic's work in graph theory led to the study of new perfect graph families such as tolerance graphs, which generalize the classical graph notions of interval graph and comparability graph. He is credited with introducing the systematic study of algorithmic aspects in intersection graph theory, and initiated research on new structured families of graphs including the edge intersection graphs of paths in trees (EPT) and trivially perfect graphs.Golumbic is currently the founder and director of the Caesarea Edmond Benjamin de Rothschild Institute for Interdisciplinary Applications of Computer Science at the University of Haifa. He also served as chairman of the Israeli Association of Artificial Intelligence (1998-2004), and founded and chaired numerous international symposia in discrete mathematics and in the foundations of artificial intelligence.This Festschrift volume, published in honor of Martin Charles Golumbic on the occasion of his 60th birthday, contains 20 papers, written by graduate students, research collaborators, and computer science colleagues, who gathered at a conference on subjects related to Martin Golumbic's manifold contributions in the field of algorithmic graph theory and artificial intelligence, held in Jerusalem, Tiberias and Haifa, Israel in September 2008. 244 pp. Englisch.…

Condition: New.

Condition: New.

Paperback. Condition: Very Good.

Condition: New. pp. xvi + 227 2009th edition.

Condition: New. pp. 296.

Paperback. Condition: Brand New. 1st edition. 227 pages. 9.29x6.06x0.55 inches. In Stock.

Condition: New.

Paperback. Condition: Brand New. 1st edition. 237 pages. 9.00x6.00x0.25 inches. In Stock.

Condition: As New. Unread book in perfect condition.

Condition: New. This definitive reference on Combinatorica contains examples of all 450 functions plus tutorial text. Num Pages: 496 pages, 10 line figures 138 exercises. BIC Classification: PBD; PBV; UFM. Category: (P) Professional & Vocational. Dimension: 279 x 210 x 26. Weight in Grams: 1116. . 2009. Reissue. paperback. . . . . …

Condition: Used.

Kartoniert / Broschiert. Condition: New.

Condition: Used.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - One ofthe most important aspects in research fields where mathematics is 'applied is the construction of a formal model of a real system. As for structural relations, graphs have turned out to provide the most appropriate tool for setting up the mathematical model. This is certainly one of the reasons for the rapid expansion in graph theory during the last decades. Furthermore, in recent years it also became clear that the two disciplines of graph theory and computer science have very much in common, and that each one has been capable of assisting significantly in the development of the other. On one hand, graph theorists have found that many of their problems can be solved by the use of com puting techniques, and on the other hand, computer scientists have realized that many of their concepts, with which they have to deal, may be conveniently expressed in the lan guage of graph theory, and that standard results in graph theory are often very relevant to the solution of problems concerning them. As a consequence, a tremendous number of publications has appeared, dealing with graphtheoretical problems from a computational point of view or treating computational problems using graph theoretical concepts.…

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the thoroughly refereed post-conference proceedings of the Kyoto Conference on Computational Geometry and Graph Theory, KyotoCGGT 2007, held in Kyoto, Japan, in June 2007, in honor of Jin Akiyama and Vasek Chvátal, on the occasion of their 60th birthdays. The 19 revised full papers, presented together with 5 invited papers, were carefully selected during two rounds of reviewing and improvement from more than 60 talks at the conference. All aspects of Computational Geometry and Graph Theory are covered, including tilings, polygons, impossible objects, coloring of graphs, Hamilton cycles, and factors of graphs.…

Condition: Used.