Graph Theory, Computational Intelligence and Thought Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday / edited by Marina Lipshteyn, Vadim E. Levit, Ross McConnell.

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 art...

Full description

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Lipshteyn, Marina (Editor), Levit, Vadim E. (Editor), McConnell, Ross (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2009.
Edition:1st ed. 2009.
Series:Theoretical Computer Science and General Issues ; 5420
Springer eBook Collection.
Subjects:
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
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.