Graph Theory, Computational Intelligence and Thought Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Lipshteyn, Marina (Επιμελητής έκδοσης), Levit, Vadim E. (Επιμελητής έκδοσης), McConnell, Ross M. (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2009.
• Σειρά: Lecture Notes in Computer Science, 5420
• Θέματα: Computer science.; Data structures (Computer science).; Algorithms.; Mathematical logic.; Computer science > Mathematics.; Artificial intelligence.; Computer graphics.; Computer Science.; Artificial Intelligence (incl. Robotics).; Algorithm Analysis and Problem Complexity.; Mathematical Logic and Formal Languages.; Discrete Mathematics in Computer Science.; Data Structures.; Computer Graphics.

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

Πίνακας περιεχομένων:

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