Logo - springer
Slogan - springer

Computer Science - Artificial Intelligence | Graph Theory, Computational Intelligence and Thought - Essays Dedicated to Martin Charles Golumbic

Graph Theory, Computational Intelligence and Thought

Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday

Lipshteyn, Marina, Levit, Vadim E., McConnell, Ross (Eds.)

2009, XIV, 227 p.

Available Formats:

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.


(net) price for USA

ISBN 978-3-642-02029-2

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase

learn more about Springer eBooks

add to marked items


Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.


(net) price for USA

ISBN 978-3-642-02028-5

free shipping for individuals worldwide

online orders shipping within 2-3 days.

add to marked items

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.

Content Level » Research

Keywords » Computational Intelligence - Graph - Graph theory - algorithms - artificial intelligence - bicolorable graph - bipartite graphs - chordal graphs - cocomparability graphs - cognition - connected graphs - constraints - edge dominating set - heuristics - optimization

Related subjects » Artificial Intelligence - Image Processing - Theoretical Computer Science

Table of contents 

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.

Popular Content within this publication 



Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Artificial Intelligence (incl. Robotics).