Description 
1 online resource (xiv, 226 pages) : illustrations (some color) 
Series 
Lecture notes in computer science, 03029743 ; 5420. Festschrift 

LNCS sublibrary. SL 1, Theoretical computer science and general issues 

Lecture notes in computer science ; 5420


Lecture notes in computer science. Festschrift.


LNCS sublibrary. SL 1, Theoretical computer science and general issues.

Contents 
Landmarks in Algorithmic Graph Theory: A Personal Retrospective  A HigherOrder 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 Distance3 Matchings and Induced Matchings  On Duality between Local Maximum Stable Sets of a Graph and Its LineGraph  On Path Partitions and Colourings in Digraphs  On Related Edges in WellCovered Graphs without Cycles of Length 4 and 6  On the Cubicity of ATFree Graphs and CircularArc Graphs  O(m logn) Split Decomposition of Strongly Connected Graphs  PathBicolorable 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 
Summary 
Martin Charles Golumbic has been making seminal contributions to algorithmic graph theory and artificial intelligence throughout his career. He is universally admired as a longstanding 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 spatialtemporal 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 (19982004), 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 
Bibliography 
Includes bibliographical references and index 
Notes 
Print version record 
Subject 
Golumbic, Martin Charles  Congresses.


Graph theory  Congresses.


Computational intelligence  Congresses.

Form 
Electronic book

Author 
Golumbic, Martin Charles.


Lipshteyn, Marina.


Levit, V. E. (Vadim Efimovich)


McConnell, Ross M.

LC no. 
2009930965 
ISBN 
9783642020292 (eisbn) 

3642020291 (eisbn) 
