Graph-Theoretic Concepts in Computer Science 32nd International Workshop, WG 2006, Bergen, Norway, June 22-24, 2006 Revised Papers /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Fomin, Fedor V. (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2006.
• Σειρά: Lecture Notes in Computer Science, 4271
• Θέματα: Computer science.; Data structures (Computer science).; Algorithms.; Numerical analysis.; Computer science > Mathematics.; Computer graphics.; Computer Science.; Algorithm Analysis and Problem Complexity.; Discrete Mathematics in Computer Science.; Numeric Computing.; Data Structures.; Computer Graphics.

 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 it took place from June 22 to June 24. The 78 participants of WG 2006 came from the universities and research institutes of 17 di?erent countries. The WG 2006 workshop continues the series of 31 previous WG workshops. Since 1975,WG has taken place 20 times in Germany, four times in The Neth- lands, twice in Austria as well as oncein France,in Italy, in Slovakia,in Switz- land and in the Czech Republic, and has now been held for the ?rst time in Norway. The workshop aims at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in computer s- ence, or by extracting new problems from applications. The goal is to present recent research results and to identify and explore directions of future research. The talks showed how recent researchresults from algorithmic graph theory can be used in computer science and which graph-theoreticquestions arisefrom new developments in computer science. There were two fascinating invited lectures by Hans Bodlaender (Utrecht, The Netherlands) and Tandy Warnow (Austin, USA). 

 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.