LEADER 05968nam 22008655 450 001 996466367903316 005 20230223032125.0 010 $a3-540-92248-2 024 7 $a10.1007/978-3-540-92248-3 035 $a(CKB)1000000000545815 035 $a(SSID)ssj0000317989 035 $a(PQKBManifestationID)11230730 035 $a(PQKBTitleCode)TC0000317989 035 $a(PQKBWorkID)10294006 035 $a(PQKB)11185901 035 $a(DE-He213)978-3-540-92248-3 035 $a(MiAaPQ)EBC3063788 035 $a(MiAaPQ)EBC6281820 035 $a(PPN)132861852 035 $a(EXLCZ)991000000000545815 100 $a20100301d2008 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aGraph-Theoretic Concepts in Computer Science$b[electronic resource] $e34th International Workshop, WG 2008, Durham, UK, June 30 -- July 2, 2008, Revised Papers /$fedited by Hajo Broersma, Thomas Erlebach, Tom Friedetzky, Daniel Paulusma 205 $a1st ed. 2008. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2008. 215 $a1 online resource (XIII, 386 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5344 300 $aProceedings of the "34th International Workshop, WG 2008, Durham, UK, June 30-July 2, 2008". 311 $a3-540-92247-4 320 $aIncludes bibliographical references and index. 327 $aInvited Contributions -- (Un)-Stable Routing in the Internet: A Survey from the Algorithmic Perspective -- Memory Efficient Anonymous Graph Exploration -- Algorithmic Meta Theorems -- Regular Papers -- A Most General Edge Elimination Polynomial -- Approximating the Metric TSP in Linear Time -- The Valve Location Problem in Simple Network Topologies -- A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs -- On the Pseudo-achromatic Number Problem -- Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings -- Faster Exact Bandwidth -- Additive Spanners for Circle Graphs and Polygonal Graphs -- Upward Straight-Line Embeddings of Directed Graphs into Point Sets -- Complexity of the Packing Coloring Problem for Trees -- Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges -- A Lower Bound on the Area Requirements of Series-Parallel Graphs -- On Independent Sets and Bicliques in Graphs -- Evaluations of Graph Polynomials -- Parameterized Complexity for Domination Problems on Degenerate Graphs -- An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph -- Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs -- The Rank-Width of the Square Grid -- Improved Upper Bounds for Partial Vertex Cover -- On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width -- Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms -- What Is between Chordal and Weakly Chordal Graphs? -- Parameterized Graph Cleaning Problems -- Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph -- Fast Robber in Planar Graphs -- From a Circular-Arc Model to a Proper Circular-Arc Model -- Digraph Decompositions and Monotonicity in Digraph Searching -- Searching for a Visible, Lazy Fugitive -- A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes -- Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs. 330 $aThis book constitutes the thoroughly refereed post-conference proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2008, held in Durham, UK, in June/July 2008. The 30 revised full papers presented together with 3 invited paper were carefully reviewed and selected from 76 submissions. The papers feature original results on all aspects of graph-theoretic concepts in Computer Science, e.g. structural graph theory, sequential, parallel, and distributed graph and network algorithms and their complexity, graph grammars and graph rewriting systems, graph-based modeling, graph-drawing and layout, diagram methods, and support of these concepts by suitable implementations. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5344 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aNumerical analysis 606 $aArtificial intelligence?Data processing 606 $aComputer graphics 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aNumerical Analysis 606 $aData Science 606 $aComputer Graphics 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aNumerical analysis. 615 0$aArtificial intelligence?Data processing. 615 0$aComputer graphics. 615 14$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aNumerical Analysis. 615 24$aData Science. 615 24$aComputer Graphics. 676 $a004.015115 686 $aDAT 537f$2stub 686 $aMAT 055f$2stub 686 $aSS 4800$2rvk 702 $aBroersma$b Hajo$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aErlebach$b Thomas$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aFriedetzky$b Tom$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aPaulusma$b Daniel$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aConference on Graphtheoretic Concepts in Computer Science (34th : 2008 : Durham, UK). 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996466367903316 996 $aGraph-Theoretic Concepts in Computer Science$92569248 997 $aUNISA