Skip to main content
SpringerLink
Log in

Graph-Theoretic Concepts in Computer Science

31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers

  • Conference proceedings
  • © 2005

Access provided by Autonomous University of Puebla

Download book PDF

Overview

Editors:
  1. Dieter Kratsch

    1. LITA, Université Paul Verlaine-Metz, Metz Cedex 01, France

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

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

Included in the following conference series:

Conference proceedings info: WG 2005.

Buy print copy

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

Keywords

Table of contents (40 papers)

  1. Front Matter

    Download chapter PDF

  2. Invited Lectures

    1. Hypertree Decompositions: Structure, Algorithms, and Applications

      • Georg Gottlob, Martin Grohe, Nysret Musliu, Marko Samer, Francesco Scarcello
      Pages 1-15
      Download chapter PDF

    2. Combinatorial Search on Graphs Motivated by Bioinformatics Applications: A Brief Survey

      • Mathilde Bouvel, Vladimir Grebinski, Gregory Kucherov
      Pages 16-27
      Download chapter PDF

  3. Regular Papers

    1. Domination Search on Graphs with Low Dominating-Target-Number

      • Divesh Aggarwal, Shashank K. Mehta, Jitender S. Deogun
      Pages 28-37
      Download chapter PDF

    2. Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs

      • Christophe Crespelle, Christophe Paul
      Pages 38-48
      Download chapter PDF

    3. Approximating Rank-Width and Clique-Width Quickly

      • Sang-il Oum
      Pages 49-58
      Download chapter PDF

    4. Computing the Tutte Polynomial on Graphs of Bounded Clique-Width

      • Omer Giménez, Petr Hliněný, Marc Noy
      Pages 59-68
      Download chapter PDF

    5. Minimizing NLC-Width is NP-Complete

      • Frank Gurski, Egon Wanke
      Pages 69-80
      Download chapter PDF

    6. Channel Assignment and Improper Choosability of Graphs

      • Frédéric Havet, Jean-Sébastien Sereni
      Pages 81-90
      Download chapter PDF

    7. Computing Treewidth and Minimum Fill-In for Permutation Graphs in Linear Time

      • Daniel Meister
      Pages 91-102
      Download chapter PDF

    8. Roman Domination over Some Graph Classes

      • Mathieu Liedloff, Ton Kloks, Jiping Liu, Sheng-Lung Peng
      Pages 103-114
      Download chapter PDF

    9. Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms

      • Jiří Fiala, Daniël Paulusma, Jan Arne Telle
      Pages 115-126
      Download chapter PDF

    10. Network Discovery and Verification

      • Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matúš Mihaľák et al.
      Pages 127-138
      Download chapter PDF

    11. Complete Graph Drawings Up to Triangle Mutations

      • Emeric Gioan
      Pages 139-150
      Download chapter PDF

    12. Collective Tree 1-Spanners for Interval Graphs

      • Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler, Chenyu Yan
      Pages 151-162
      Download chapter PDF

    13. On Stable Cutsets in Claw-Free Graphs and Planar Graphs

      • Van Bang Le, Raffaele Mosca, Haiko Müller
      Pages 163-174
      Download chapter PDF

    14. Induced Subgraphs of Bounded Degree and Bounded Treewidth

      • Prosenjit Bose, Vida Dujmović, David R. Wood
      Pages 175-186
      Download chapter PDF

    15. Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time

      • Pinar Heggernes, Daniel Lokshtanov
      Pages 187-198
      Download chapter PDF

    16. Ultimate Generalizations of LexBFS and LEX M

      • Anne Berry, Richard Krueger, Genevieve Simonet
      Pages 199-213
      Download chapter PDF

    17. Adding an Edge in a Cograph

      • Stavros D. Nikolopoulos, Leonidas Palios
      Pages 214-226
      Download chapter PDF
Back to top

Other volumes

  1. Graph-Theoretic Concepts in Computer Science

Editors and Affiliations

  • LITA, Université Paul Verlaine-Metz, Metz Cedex 01, France

    Dieter Kratsch

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation