000 05384nam a22006615i 4500
001 978-3-642-02029-2
003 DE-He213
005 20240423130020.0
007 cr nn 008mamaa
008 100301s2009 gw | s |||| 0|eng d
020 _a9783642020292
_9978-3-642-02029-2
024 7 _a10.1007/978-3-642-02029-2
_2doi
050 4 _aQ334-342
050 4 _aTA347.A78
072 7 _aUYQ
_2bicssc
072 7 _aCOM004000
_2bisacsh
072 7 _aUYQ
_2thema
082 0 4 _a006.3
_223
245 1 0 _aGraph Theory, Computational Intelligence and Thought
_h[electronic resource] :
_bEssays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday /
_cedited by Marina Lipshteyn, Vadim E. Levit, Ross McConnell.
250 _a1st ed. 2009.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2009.
300 _aXIV, 227 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5420
505 0 _aLandmarks 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.
520 _aMartin 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.
650 0 _aArtificial intelligence.
650 0 _aAlgorithms.
650 0 _aMachine theory.
650 0 _aComputer science
_xMathematics.
650 0 _aDiscrete mathematics.
650 0 _aArtificial intelligence
_xData processing.
650 0 _aComputer graphics.
650 1 4 _aArtificial Intelligence.
650 2 4 _aAlgorithms.
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aData Science.
650 2 4 _aComputer Graphics.
700 1 _aLipshteyn, Marina.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aLevit, Vadim E.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aMcConnell, Ross.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642020285
776 0 8 _iPrinted edition:
_z9783642020308
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5420
856 4 0 _uhttps://doi.org/10.1007/978-3-642-02029-2
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c184115
_d184115