LEADER 04406nam 2200637Ia 450 001 9910484753003321 005 20200520144314.0 010 $a1-280-38546-4 010 $a9786613563385 010 $a3-642-11409-1 024 7 $a10.1007/978-3-642-11409-0 035 $a(CKB)1000000000812683 035 $a(SSID)ssj0000355516 035 $a(PQKBManifestationID)11233500 035 $a(PQKBTitleCode)TC0000355516 035 $a(PQKBWorkID)10320433 035 $a(PQKB)11785138 035 $a(DE-He213)978-3-642-11409-0 035 $a(MiAaPQ)EBC3064900 035 $a(PPN)149054904 035 $a(EXLCZ)991000000000812683 100 $a20091119d2010 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aGraph-theoretic concepts in computer science $e35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009 ; revised papers /$fChristophe Paul, Michel Habib (eds.) 205 $a1st ed. 2010. 210 $aBerlin ;$aNew York $cSpringer$dc2010 215 $a1 online resource (XIII, 353 p.) 225 1 $aLecture notes in computer science ;$v5911 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-11408-3 320 $aIncludes bibliographical references and index. 327 $aGraph-Theoretic Solutions to Computational Geometry Problems -- Algorithms for Classes of Graphs with Bounded Expansion -- A Graph Polynomial Arising from Community Structure (Extended Abstract) -- Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs -- Maximum Series-Parallel Subgraph -- Low-Port Tree Representations -- Fully Dynamic Representations of Interval Graphs -- The Parameterized Complexity of Some Minimum Label Problems -- Exact and Parameterized Algorithms for Max Internal Spanning Tree -- An Exact Algorithm for Minimum Distortion Embedding -- Sub-coloring and Hypo-coloring Interval Graphs -- Parameterized Complexity of Generalized Domination Problems -- Connected Feedback Vertex Set in Planar Graphs -- Logical Locality Entails Frugal Distributed Computation over Graphs (Extended Abstract) -- On Module-Composed Graphs -- An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees -- The k-Disjoint Paths Problem on Chordal Graphs -- Local Algorithms for Edge Colorings in UDGs -- Directed Rank-Width and Displit Decomposition -- An Algorithmic Study of Switch Graphs -- Hardness Results and Efficient Algorithms for Graph Powers -- Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph -- Injective Oriented Colourings -- Chordal Digraphs -- A New Intersection Model and Improved Algorithms for Tolerance Graphs -- Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes -- Distance d-Domination Games -- Cycles, Paths, Connectivity and Diameter in Distance Graphs -- Smallest Odd Holes in Claw-Free Graphs (Extended Abstract) -- Finding Induced Paths of Given Parity in Claw-Free Graphs. 330 $aThis book constitutes the thoroughly refereed post-conference proceedings of the 35th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2009, held in Montpellier, France, in June 2009. The 28 revised full papers presented together with two invited papers were carefully reviewed and selected from 69 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$aLecture notes in computer science ;$v5911. 606 $aGraph theory$vCongresses 606 $aGraph algorithms$vCongresses 615 0$aGraph theory 615 0$aGraph algorithms 676 $a004.015115 686 $aDAT 537f$2stub 686 $aMAT 055f$2stub 686 $aSS 4800$2rvk 701 $aPaul$b Christophe$0159742 701 $aHabib$b M$g(Michel)$01755834 712 12$aInternational Workshop WG 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484753003321 996 $aGraph-theoretic concepts in computer science$94192797 997 $aUNINA