Graph Theory, Computational Intelligence and Thought
Springer Berlin (Verlag)
978-3-642-02028-5 (ISBN)
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.
Landmarks in Algorithmic Graph Theory: A Personal Retrospective.- A Higher-Order Graph Calculus for Autonomic Computing.- Algorithms on Subtree Filament Graphs.- A Note on the Recognition of Nested Graphs.- Asynchronous Congestion Games.- Combinatorial Problems for Horn Clauses.- Covering a Tree by a Forest.- Dominating Induced Matchings.- HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results.- Local Search Heuristics for the Multidimensional Assignment Problem.- On Distance-3 Matchings and Induced Matchings.- On Duality between Local Maximum Stable Sets of a Graph and Its Line-Graph.- On Path Partitions and Colourings in Digraphs.- On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6.- On the Cubicity of AT-Free Graphs and Circular-Arc Graphs.- O(m logn) Split Decomposition of Strongly Connected Graphs.- Path-Bicolorable Graphs.- Path Partitions, Cycle Covers and Integer Decomposition.- Properly Coloured Cycles and Paths: Results and Open Problems.- Recognition of Antimatroidal Point Sets.- Tree Projections: Game Characterization and Computational Aspects.
From the reviews: "In 2008, a weeklong conference was organized to celebrate Golumbic's 60th birthday. This volume is a collection of the conference proceedings ... . It contains 20 papers, in addition to Golumbic's conference lecture. ... papers are accessible even to readers who only have a rudimentary understanding of Golumbic's work. ... Three groups of people would benefit from reading this volume: researchers in Golumbic's circle, researchers ... who are looking for a new frontier to, and graduate students in pursuit of a research topic." (San Skulrattanakulchai, ACM Computing Reviews, March, 2009)
From the reviews:
“In 2008, a weeklong conference was organized to celebrate Golumbic’s 60th birthday. This volume is a collection of the conference proceedings … . It contains 20 papers, in addition to Golumbic’s conference lecture. … papers are accessible even to readers who only have a rudimentary understanding of Golumbic’s work. … Three groups of people would benefit from reading this volume: researchers in Golumbic’s circle, researchers … who are looking for a new frontier to, and graduate students in pursuit of a research topic.” (San Skulrattanakulchai, ACM Computing Reviews, March, 2009)
| Erscheint lt. Verlag | 20.7.2009 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
| Zusatzinfo | XIV, 227 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 382 g |
| Themenwelt | Informatik ► Theorie / Studium ► Künstliche Intelligenz / Robotik |
| Schlagworte | Algorithm analysis and problem complexity • algorithms • Artificial Intelligence • bicolorable graph • Bipartite Graphs • chordal graphs • cocomparability graphs • Cognition • combinatorial optimization • Computational Complexity • Computational Intelligence • connected graphs • constraints • construction heuristics • data structures • Decomposition • edge dominating set • fast heuristics • Festschrift • formal specification • Golumbic, Martin Ch. • Graph • Graph Algorithms • graph calculi • graph theory • Hardcover, Softcover / Informatik, EDV/Informatik • Heuristics • Hypergraphs • induced matching • intersection graphs • linear time recognition • matching problem • Optimization • path partitions • perfect graph • polynomial-time algorithm • Recursion • reduction • semantic knowledge • split subgraph • strongly connected graphs • subtree graph • systems modeling • tree projections • verification |
| ISBN-10 | 3-642-02028-3 / 3642020283 |
| ISBN-13 | 978-3-642-02028-5 / 9783642020285 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
