LEADER 06292nam 22007935 450 001 9910768437903321 005 20200701171628.0 010 $a3-540-39890-2 024 7 $a10.1007/b93953 035 $a(CKB)1000000000212237 035 $a(SSID)ssj0000323621 035 $a(PQKBManifestationID)11246659 035 $a(PQKBTitleCode)TC0000323621 035 $a(PQKBWorkID)10303434 035 $a(PQKB)11670874 035 $a(DE-He213)978-3-540-39890-5 035 $a(MiAaPQ)EBC3088978 035 $a(PPN)155207067 035 $a(EXLCZ)991000000000212237 100 $a20121227d2003 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aGraph-Theoretic Concepts in Computer Science $e29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers /$fedited by Hans L. Bodlaender 205 $a1st ed. 2003. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2003. 215 $a1 online resource (XII, 392 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2880 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-20452-0 320 $aIncludes bibliographical references and index. 327 $aInvited Lecture -- Blow-Ups, Win/Win?s, and Crown Rules: Some New Directions in FPT -- Matching, Edge-Colouring, and Dimers -- Regular Papers -- Minimum Flow Time Graph Ordering -- Searching Is Not Jumping -- Incremental Integration Tools for Chemical Engineering: An Industrial Application of Triple Graph Grammars -- The Minimum Degree Heuristic and the Minimal Triangulation Process -- Generalized Parametric Multi-terminal Flows Problem -- Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding, and Generation -- The Complexity of the Matching-Cut Problem for Planar Graphs and Other Graph Classes -- Tree Spanners for Bipartite Graphs and Probe Interval Graphs -- A Simple Linear Time LexBFS Cograph Recognition Algorithm -- Backbone Colorings for Networks -- Greedy Edge-Disjoint Paths in Complete Graphs -- Graph-Based Approaches to Software Watermarking -- Completely Connected Clustered Graphs -- An FPT Algorithm for Set Splitting -- Drawing Planar Graphs on a Curve -- Tree-Partitions of k-Trees with Applications in Graph Layout -- Resource Allocation Problems in Multifiber WDM Tree Networks -- An Improved Upper Bound on the Crossing Number of the Hypercube -- NCE Graph Grammars and Clique-Width -- Chordal Probe Graphs -- Subgraph Induced Planar Connectivity Augmentation -- On the Recognition of General Partition Graphs -- Short Cycles in Planar Graphs -- Complexity of Hypergraph Coloring and Seidel?s Switching -- Feedback Vertex Set and Longest Induced Path on AT-Free Graphs -- The Complexity of Graph Contractions -- Tree Spanners, Cayley Graphs, and Diametrically Uniform Graphs -- The Probabilistic Minimum Coloring Problem -- Recognizing Bipolarizable and P 4-Simplicial Graphs -- Coloring Powers of Graphs of Bounded Clique-Width -- Erratum -- Erratum: Cycles in Generalized Networks. 330 $aThe 29th International Workshop on Graph-Theoretic Concepts in Computer Science(WG2003)washeldintheMennorodeconferenceCenterinElspeet,The Netherlands.TheworkshopwasorganizedbytheCenterforAlgorithmicSystems of the Institute of Information and Computing Sciences of Utrecht University. The workshop took place June 19?21, 2003. The 72 participants of WG 2003 came from universities and research institutes from 18 di?erent countries and ?ve di?erent continents. The workshop looks back at a long tradition. It was ?rst held in 1975, and has been held 20 times in Germany, twice in Austria, and once in Italy, Slo- kia, Switzerland, and the Czech Republic, and has now been held for the third time in The Netherlands. The workshop aims at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in computerscience,orbyextractingnewproblemsfromapplications.Itisdevoted to the theoretical and practical aspects of graph concepts in computer science. The goal is to present recent research results and to identify and explore - rections of future research. The talks given at the workshop showed how recent research results from algorithmic graph theory can be used in computer science and which graph-theoretic questions arise from new developments in computer science. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2880 606 $aComputers 606 $aComputer simulation 606 $aAlgorithms 606 $aData structures (Computer science) 606 $aNumerical analysis 606 $aComputer science?Mathematics 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aSimulation and Modeling$3https://scigraph.springernature.com/ontologies/product-market-codes/I19000 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aData Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/I15017 606 $aNumeric Computing$3https://scigraph.springernature.com/ontologies/product-market-codes/I1701X 606 $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028 615 0$aComputers. 615 0$aComputer simulation. 615 0$aAlgorithms. 615 0$aData structures (Computer science). 615 0$aNumerical analysis. 615 0$aComputer science?Mathematics. 615 14$aTheory of Computation. 615 24$aSimulation and Modeling. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aData Structures. 615 24$aNumeric Computing. 615 24$aDiscrete Mathematics in Computer Science. 676 $a511.6 702 $aBodlaender$b Hans L$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910768437903321 996 $aGraph-Theoretic Concepts in Computer Science$92569248 997 $aUNINA