LEADER 05295nam 22007815 450 001 9910767577903321 005 20200705081344.0 010 $a3-540-45477-2 024 7 $a10.1007/3-540-45477-2 035 $a(CKB)1000000000211601 035 $a(SSID)ssj0000323619 035 $a(PQKBManifestationID)11247885 035 $a(PQKBTitleCode)TC0000323619 035 $a(PQKBWorkID)10299477 035 $a(PQKB)10660899 035 $a(DE-He213)978-3-540-45477-9 035 $a(MiAaPQ)EBC3072825 035 $a(PPN)155186248 035 $a(EXLCZ)991000000000211601 100 $a20121227d2001 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aGraph-Theoretic Concepts in Computer Science $e27th International Workshop, WG 2001 Boltenhagen, Germany, June 14-16, 2001 Proceedings /$fedited by Andreas Brandstädt, Van Bang Le 205 $a1st ed. 2001. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2001. 215 $a1 online resource (X, 334 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2204 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-42707-4 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aMedian Hulls as Steiner Hulls in Rectilinear and Molecular Sequence Spaces -- Data Management in Networks -- Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs -- Approximate Constrained Bipartite Edge Coloring -- Maximum Clique Transversals -- On the Tree-Degree of Graphs -- On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms -- (k+) -Disatance- Herediatry Graphs -- On the Relationship between Clique-Width and Treewidth -- Planarity of the 2-Level Cactus Model -- Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach -- How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time -- (g, f)-Factorizations Orthogonal to k Subgraphs -- On Star Coloring of Graphs -- Graph Subcolorings: Complexity and Algorithms -- Approximation of Pathwidth of Outerplanar Graphs -- On the Monotonicity of Games Generated by Symmetric Submodular Functions -- Multiple Hotlink Assignment -- Small k-Dominating Sets in Planar Graphs with Applications -- Lower Bounds for Algorithms for the Steiner Tree Problem -- log n-Approximative NLCk-Decomposition in O(n 2k+1) Time -- On Subfamilies of AT-Free Graphs -- Complexity of Coloring Graphs without Forbidden Induced Subgraphs -- On Stable Cutsets in Line Graphs -- On Strong Menger-Connectivity of Star Graphs -- The Complexity of the Matching-Cut Problem -- De Bruijn Graphs and DNA Graphs -- A Generic Greedy Algorithm, Partially-Ordered Graphs and NP-Completeness -- Critical and Anticritical Edges in Perfect Graphs. 330 $aThis book constitutes the thoroughly refereed post-workshop proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2001, held in Boltenhagen, Germany, in June 2001. The 27 revised full papers presented together with two invited contributions were carefully reviewed and selected from numerous submissions. The papers provide a wealth of new results for various classes of graphs, graph computations, graph algorithms and graph-theoretical applications in various fields. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2204 606 $aComputer programming 606 $aComputers 606 $aData structures (Computer science) 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aData Structures and Information Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/I15009 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028 606 $aData Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/I15017 615 0$aComputer programming. 615 0$aComputers. 615 0$aData structures (Computer science). 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 14$aProgramming Techniques. 615 24$aTheory of Computation. 615 24$aData Structures and Information Theory. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aData Structures. 676 $a004.015115 702 $aBrandstädt$b Andreas$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aLe$b Van Bang$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910767577903321 996 $aGraph-Theoretic Concepts in Computer Science$92569248 997 $aUNINA