Detailansicht

Graph Theory, Computational Intelligence and Thought

Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday, Lecture Notes in Computer Science 5420 - Theoretical Computer Science and General Issues
ISBN/EAN: 9783642020285
Umbreit-Nr.: 1286819

Sprache: Englisch
Umfang: xiv, 227 S.
Format in cm:
Einband: kartoniertes Buch

Erschienen am 20.07.2009
Auflage: 1/2009
€ 53,49
(inklusive MwSt.)
Lieferbar innerhalb 1 - 2 Wochen
  • Kurztext
    • Published to mark the 60th birthday of Martin Charles Golumbic, whose work on algorithmic graph theory and artificial intelligence is widely celebrated, this text contains papers by graduate students, research collaborators, and computer science colleagues.
  • Autorenportrait
    • InhaltsangabeLandmarks 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.