The 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009) took place at Montpellier (France), June 24-26 2009. About 80 computer scientists from all over the world (Australia, Belgium, Canada, China, Czech Republic, France, Germany, Greece, Israel, Japan, Korea, The Netherlands, Norway, Spain, UK, USA) attended the conference. Since1975,ithastakenplace20timesinGermany,fourtimesinTheNeth- lands, twice in Austria, as well as once in Italy, Slovakia, Switzerland, the Czech Republic, France, Norway, and the UK. The conference aims at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in computer science, or by extracting new problems from appli- tions. The goal is to present recent research results and to identify and explore directions of future research. The conference is well-balanced with respect to established researchers and young scientists. There were 69 submissions. Each submission was reviewed by at least three, and on average four, Program Committee members. The Committee decided to accept 28 papers. Due to the competition and the limited schedule, some good papers could not be accepted. Theprogramalsoincludedexcellentinvitedtalks:onegivenbyDanielKràlon "AlgorithmsforClassesofGraphswithBoundedExpansion," the otherbyDavid Eppsteinon"Graph-TheoreticSolutionstoComputationalGeometryProblems." The proceedings contains two survey papers on these topics.
Reihe
Sprache
Verlagsort
Verlagsgruppe
Zielgruppe
Für Beruf und Forschung
Research
Illustrationen
Maße
Höhe: 23.5 cm
Breite: 15.5 cm
Gewicht
ISBN-13
978-3-642-11408-3 (9783642114083)
DOI
10.1007/978-3-642-11409-0
Schweitzer Klassifikation
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.
