Skip to main content
SpringerLink
Log in

Graph-Theoretic Concepts in Computer Science

40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers

  • Conference proceedings
  • © 2014

Overview

Editors:
  1. Dieter Kratsch

    1. LITA, Université de Lorraine, Metz Cedex 01, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Ioan Todinca

    1. Université d'Orléans, Orléans, 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 8747)

Included in the following conference series:

Conference proceedings info: WG 2014.

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 EPUB and 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

About this book

This book constitutes the thoroughly refereed post-conference proceedings of the 40th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2014, held in Nouan-le-Fuzelier, France, in June 2014.

The 32 revised full papers presented were carefully reviewed and selected from 80 submissions. The book also includes two invited papers. The papers cover a wide range of topics in graph theory related to computer science, such as design and analysis of sequential, parallel, randomized, parameterized and distributed graph and network algorithms; structural graph theory with algorithmic or complexity applications; computational complexity of graph and network problems; graph grammars, graph rewriting systems and graph modeling; graph drawing and layouts; computational geometry; random graphs and models of the web and scale-free networks; and support of these concepts by suitable implementations and applications.

Similar content being viewed by others

Keywords

Table of contents (34 papers)

  1. Front Matter

    Pages I-XI
    Download chapter PDF

  2. Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract)

    • Reinhard Diestel, Sang-il Oum
    Pages 1-14

  3. Distributedly Testing Cycle-Freeness

    • Heger Arfaoui, Pierre Fraigniaud, David Ilcinkas, Fabien Mathieu
    Pages 15-28

  4. DMVP: Foremost Waypoint Coverage of Time-Varying Graphs

    • Eric Aaron, Danny Krizanc, Elliot Meyerson
    Pages 29-41

  5. Linear Rank-Width of Distance-Hereditary Graphs

    • Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon
    Pages 42-55

  6. Vertex Contact Graphs of Paths on a Grid

    • Nieke Aerts, Stefan Felsner
    Pages 56-68

  7. Deciding the Bell Number for Hereditary Graph Properties

    • Aistis Atminas, Andrew Collins, Jan Foniok, Vadim V. Lozin
    Pages 69-80

  8. Boxicity and Separation Dimension

    • Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew, Deepak Rajendraprasad
    Pages 81-92

  9. Maximal Induced Matchings in Triangle-Free Graphs

    • Manu Basavaraju, Pinar Heggernes, Pim van ’t Hof, Reza Saei, Yngve Villanger
    Pages 93-104

  10. Independent Set Reconfiguration in Cographs

    • Paul Bonsma
    Pages 105-116

  11. Structural Parameterizations for Boxicity

    • Henning Bruhn, Morgan Chopin, Felix Joos, Oliver Schaudt
    Pages 117-128

  12. A New Characterization of \(P_k\)-free Graphs

    • Eglantine Camby, Oliver Schaudt
    Pages 129-138

  13. Contact Representations of Planar Graphs: Extending a Partial Representation is Hard

    • Steven Chaplick, Paul Dorbec, Jan Kratochvíl, Mickael Montassier, Juraj Stacho
    Pages 139-151

  14. The Maximum Labeled Path Problem

    • Basile Couëtoux, Elie Nakache, Yann Vaxès
    Pages 152-163

  15. Minimum Spanning Tree Verification Under Uncertainty

    • Thomas Erlebach, Michael Hoffmann
    Pages 164-175

  16. Towards the Hanani-Tutte Theorem for Clustered Graphs

    • Radoslav Fulek
    Pages 176-188

  17. On Set Expansion Problems and the Small Set Expansion Conjecture

    • Rajiv Gandhi, Guy Kortsarz
    Pages 189-200

  18. Hadwiger Number of Graphs with Small Chordality

    • Petr A. Golovach, Pinar Heggernes, Pim van ’t Hof, Christophe Paul
    Pages 201-213

  19. Recognizing Threshold Tolerance Graphs in \(O(n^2)\) Time

    • Petr A. Golovach, Pinar Heggernes, Nathan Lindzey, Ross M. McConnell, Vinícius Fernandes dos Santos, Jeremy P. Spinrad
    Pages 214-224

  20. Induced Disjoint Paths in Circular-Arc Graphs in Linear Time

    • Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen
    Pages 225-237
Back to top

Other volumes

  1. Graph-Theoretic Concepts in Computer Science

Editors and Affiliations

  • LITA, Université de Lorraine, Metz Cedex 01, France

    Dieter Kratsch

  • Université d'Orléans, Orléans, France

    Ioan Todinca

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation