Skip to main content
SpringerLink
Log in
Book cover

Graph-Theoretic Concepts in Computer Science

32nd International Workshop, WG 2006, Bergen, Norway, June 22-23, 2006, Revised Papers

  • Conference proceedings
  • © 2006

Overview

Editors:
  1. Fedor V. Fomin

    1. Department of Informatics, University of Bergen, Bergen, Norway

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 4271)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: WG 2006.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (31 papers)

  1. Front Matter

    Download chapter PDF

  2. Treewidth: Characterizations, Applications, and Computations

    • Hans L. Bodlaender
    Pages 1-14

  3. Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy

    • Jiří Fiala, Jan Kratochvíl
    Pages 15-26

  4. Generalised Dualities and Finite Maximal Antichains

    • Jan Foniok, Jaroslav Nešetřil, Claude Tardif
    Pages 27-36

  5. Chordal Deletion Is Fixed-Parameter Tractable

    • Dániel Marx
    Pages 37-48

  6. A Fixed-Parameter Algorithm for the Minimum Weight Triangulation Problem Based on Small Graph Separators

    • Christian Knauer, Andreas Spillner
    Pages 49-57

  7. Divide-and-Color

    • Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith
    Pages 58-67

  8. Listing Chordal Graphs and Interval Graphs

    • Masashi Kiyomi, Shuji Kijima, Takeaki Uno
    Pages 68-77

  9. A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs

    • Serge Gaspers, Mathieu Liedloff
    Pages 78-89

  10. Improved Edge-Coloring with Three Colors

    • Łukasz Kowalik
    Pages 90-101

  11. Vertex Coloring of Comparability+ke and –ke Graphs

    • Yasuhiko Takenaga, Kenichi Higashide
    Pages 102-112

  12. Convex Drawings of Graphs with Non-convex Boundary

    • Seok-Hee Hong, Hiroshi Nagamochi
    Pages 113-124

  13. How to Sell a Graph: Guidelines for Graph Retailers

    • Alexander Grigoriev, Joyce van Loon, René Sitters, Marc Uetz
    Pages 125-136

  14. Strip Graphs: Recognition and Scheduling

    • Magnús M. Halldórsson, Ragnar K. Karlsson
    Pages 137-146

  15. Approximating the Traffic Grooming Problem in Tree and Star Networks

    • Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
    Pages 147-158

  16. Bounded Arboricity to Determine the Local Structure of Sparse Graphs

    • Gaurav Goel, Jens Gustedt
    Pages 159-167

  17. An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time

    • Andrew R. Curtis, Clemente Izurieta, Benson Joeris, Scott Lundberg, Ross M. McConnell
    Pages 168-178

  18. Partitioned Probe Comparability Graphs

    • David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng
    Pages 179-190

  19. Computing Graph Polynomials on Graphs of Bounded Clique-Width

    • J. A. Makowsky, Udi Rotics, Ilya Averbouch, Benny Godlin
    Pages 191-204

  20. Generation of Graphs with Bounded Branchwidth

    • Christophe Paul, Andrzej Proskurowski, Jan Arne Telle
    Pages 205-216
Back to top

Other volumes

  1. Graph-Theoretic Concepts in Computer Science

Keywords

About this book

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

Editors and Affiliations

  • Department of Informatics, University of Bergen, Bergen, Norway

    Fedor V. Fomin

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation