Graph-Theoretic Concepts in Computer Science 32nd International Workshop, WG 2006, Bergen, Norway, June 22-23, 2006, Revised Papers / edited by Fedor V. Fomin.

The 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2006) was held on the island of Sotra close to the city of Bergen on the west coast of Norway. The workshop was organized by the Algorithms Research Group at the Department of Informatics, University of Bergen, and i...

Full description

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Fomin, Fedor V. (Editor, http://id.loc.gov/vocabulary/relators/edt)
Format: eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2006.
Edition:1st ed. 2006.
Series:Theoretical Computer Science and General Issues ; 4271
Springer eBook Collection.
Subjects:
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
Table of Contents:
  • Treewidth: Characterizations, Applications, and Computations
  • Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy
  • Generalised Dualities and Finite Maximal Antichains
  • Chordal Deletion Is Fixed-Parameter Tractable
  • A Fixed-Parameter Algorithm for the Minimum Weight Triangulation Problem Based on Small Graph Separators
  • Divide-and-Color
  • Listing Chordal Graphs and Interval Graphs
  • A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs
  • Improved Edge-Coloring with Three Colors
  • Vertex Coloring of Comparability+ke and –ke Graphs
  • Convex Drawings of Graphs with Non-convex Boundary
  • How to Sell a Graph: Guidelines for Graph Retailers
  • Strip Graphs: Recognition and Scheduling
  • Approximating the Traffic Grooming Problem in Tree and Star Networks
  • Bounded Arboricity to Determine the Local Structure of Sparse Graphs
  • An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time
  • Partitioned Probe Comparability Graphs
  • Computing Graph Polynomials on Graphs of Bounded Clique-Width
  • Generation of Graphs with Bounded Branchwidth
  • Minimal Proper Interval Completions
  • Monotony Properties of Connected Visible Graph Searching
  • Finding Intersection Models of Weakly Chordal Graphs
  • A Fully Dynamic Algorithm for the Recognition of P 4-Sparse Graphs
  • Clique Graph Recognition Is NP-Complete
  • Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms
  • Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs
  • Graph Labelings Derived from Models in Distributed Computing
  • Flexible Matchings
  • Simultaneous Graph Embeddings with Fixed Edges
  • Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions
  • Circular-Perfect Concave-Round Graphs.