LEADER 06115nam 22009375 450 001 996465872603316 005 20230405234208.0 010 $a1-282-29777-5 010 $a9786612297779 010 $a3-642-02029-1 024 7 $a10.1007/978-3-642-02029-2 035 $a(CKB)1000000000761246 035 $a(EBL)450798 035 $a(OCoLC)437347104 035 $a(SSID)ssj0000297849 035 $a(PQKBManifestationID)11226253 035 $a(PQKBTitleCode)TC0000297849 035 $a(PQKBWorkID)10343550 035 $a(PQKB)11625113 035 $a(DE-He213)978-3-642-02029-2 035 $a(MiAaPQ)EBC450798 035 $a(MiAaPQ)EBC6281762 035 $a(PPN)136310230 035 $a(EXLCZ)991000000000761246 100 $a20100301d2009 u| 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aGraph Theory, Computational Intelligence and Thought$b[electronic resource] $eEssays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday /$fedited by Marina Lipshteyn, Vadim E. Levit, Ross McConnell 205 $a1st ed. 2009. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2009. 215 $a1 online resource (237 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5420 300 $aDescription based upon print version of record. 311 $a3-642-02028-3 320 $aIncludes bibliographical references and index. 327 $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. 330 $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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5420 606 $aArtificial intelligence 606 $aAlgorithms 606 $aMachine theory 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aArtificial intelligence?Data processing 606 $aComputer graphics 606 $aArtificial Intelligence 606 $aAlgorithms 606 $aFormal Languages and Automata Theory 606 $aDiscrete Mathematics in Computer Science 606 $aData Science 606 $aComputer Graphics 615 0$aArtificial intelligence. 615 0$aAlgorithms. 615 0$aMachine theory. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aArtificial intelligence?Data processing. 615 0$aComputer graphics. 615 14$aArtificial Intelligence. 615 24$aAlgorithms. 615 24$aFormal Languages and Automata Theory. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aData Science. 615 24$aComputer Graphics. 676 $a511.5 686 $aDAT 357f$2stub 686 $aMAT 055f$2stub 686 $aSS 4800$2rvk 702 $aLipshteyn$b Marina$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aLevit$b Vadim E$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMcConnell$b Ross$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465872603316 996 $aGraph theory, computational intelligence and thought$91120323 997 $aUNISA