Graph-Theoretic Concepts in Computer Science 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009, Revised Papers

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 revie...

Full description

Corporate Author: SpringerLink (Online service)
Other Authors: Paul, Christophe (Editor), Habib, Michel (Editor)
Format: eBook
Published: Berlin, Heidelberg Springer Berlin Heidelberg 2010, 2010
Edition:1st ed. 2010
Series:Theoretical Computer Science and General Issues
Online Access:
Collection: Springer eBooks 2005- - Collection details see MPG.ReNa
Table of Contents:
  • 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