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

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Paul, Christophe (Επιμελητής έκδοσης), Habib, Michel (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010.
• Σειρά: Lecture Notes in Computer Science, 5911
• Θέματα: Computer science.; Data structures (Computer science).; Algorithms.; Computer science > Mathematics.; Geometry.; Computer Science.; Discrete Mathematics in Computer Science.; Symbolic and Algebraic Manipulation.; Algorithm Analysis and Problem Complexity.; Data Structures.

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

Πίνακας περιεχομένων:

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