Graph-theoretic concepts in computer science : 35th international workshop, WG 2009, Montpellier, France, June 24-26, 2009 : revised papers / Christophe Paul, Michel Habib (eds.).
By: (35th : Conference on Graphtheoretic Concepts in Computer Science (35th : 2009 : Montpellier, France)
Contributor(s): Paul, Christophe | Habib, M. (Michel)Material type: TextSeries: SerienbezeichnungLecture notes in computer science: 5911.; Lecture notes in computer science: ; LNCS sublibrary: Publisher: Berlin ; New York : Springer, ©2010Description: 1 online resource (xiii, 353 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783642114090; 3642114091Other title: WG 2009Subject(s): Graph theory -- Data processing -- Congresses | Computer science -- Congresses | Graph theory -- Congresses | Informatique | Computer science | Graph theory | Graph theory -- Data processing | wiskunde | mathematics | meetkunde | geometry | algoritmen | algorithms | computeranalyse | computer analysis | computerwetenschappen | computer sciences | algebra | gegevensstructuren | data structures | Information and Communication Technology (General) | Informatie- en communicatietechnologie (algemeen)Genre/Form: Electronic books. | Conference papers and proceedings. Additional physical formats: Print version:: Graph-theoretic concepts in computer science.DDC classification: 511/.5 LOC classification: QA166 | .C664 2010Online resources: Click here to access online
|Item type||Current location||Collection||Call number||Status||Date due||Barcode||Item holds|
Includes bibliographical references and index.
Print version record.
Graph-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.
This 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.