Skip to main content
Book cover
  • Conference proceedings
  • © 2005

Graph-Theoretic Concepts in Computer Science

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

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)

Conference series link(s): WG: International Workshop on Graph-Theoretic Concepts in Computer Science

Conference proceedings info: WG 2005.

Sections

eBook USD 99.00
Price excludes VAT (USA)
  • ISBN: 978-3-540-31468-4
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 129.00
Price excludes VAT (USA)
Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (40 papers)

  1. Front Matter

    PDF

  2. Invited Lectures

    1. Hypertree Decompositions: Structure, Algorithms, and Applications

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

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

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

  3. Regular Papers

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

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

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

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

    5. Minimizing NLC-Width is NP-Complete

      • Frank Gurski, Egon Wanke
      Pages 69-80

    6. Channel Assignment and Improper Choosability of Graphs

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

    8. Roman Domination over Some Graph Classes

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

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

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

    10. Network Discovery and Verification

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

    12. Collective Tree 1-Spanners for Interval Graphs

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

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

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

    14. Induced Subgraphs of Bounded Degree and Bounded Treewidth

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

    15. Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time

      • Pinar Heggernes, Daniel Lokshtanov
      Pages 187-198

    16. Ultimate Generalizations of LexBFS and LEX M

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

    17. Adding an Edge in a Cograph

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

Other Volumes

  1. Graph-Theoretic Concepts in Computer Science

Back to top

Keywords

  • Algorithms
  • Graph
  • algorithm
  • algorithmic geometry
  • algorithmic graph theory
  • approximation
  • combinatorial optimization
  • complexity theory
  • computational discrete mathematics
  • computer
  • computer science
  • graph algorithms
  • graph coloring
  • graph computations
  • graph decomposition
  • algorithm analysis and problem complexity
  • data structures
Back to top

Editors and Affiliations

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

    Dieter Kratsch

Back to top

Bibliographic Information

Back to top
Access via your institution
eBook USD 99.00
Price excludes VAT (USA)
  • ISBN: 978-3-540-31468-4
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 129.00
Price excludes VAT (USA)
Learn about institutional subscriptions