[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
Springer Nature Link
Account

Graph-Theoretic Concepts in Computer Science

24th International Workshop, WG'98, Smolenice Castle, Slovak Republic, June 18-20, Proceedings

  • Conference proceedings
  • © 1998

Overview

Editors:
  1. Juraj Hromkovič

    1. Department of Computer Science, ETH Zurich, ETH Zentrum, Zurich, Switzerland

  2. Ondrej Sýkora

    1. Department of Computer Science, University of Loughborough, Loughborough, UK

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

Included in the following conference series:

Conference proceedings info: WG 1998.

  • 14k Accesses

  • 1 Citation

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

Access this book

Log in via an institution
eBook GBP 35.99
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book GBP 44.99
Price includes VAT (United Kingdom)
  • 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

Keywords

Table of contents (30 papers)

  1. Front Matter

    Pages I-X
    Download chapter PDF

  2. Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width

    • B. Courcelle, J. A. Makowsky, U. Rotics
    Pages 1-16

  3. Minus Domination in Small-Degree Graphs

    • Peter Damaschke
    Pages 17-25

  4. The Vertex-Disjoint Triangles Problem

    • Venkatesan Guruswami, C. Pandu Rangan, M. S. Chang, G. J. Chang, C. K. Wong
    Pages 26-37

  5. Communication in the Two-Way Listen-in Vertex-Disjoint Paths Mode

    • Hans-Joachim Böckenhauer
    Pages 38-49

  6. Broadcasting on Anonymous Unoriented Tori

    • Stefan Dobrev, Peter Ružička
    Pages 50-62

  7. Families of Graphs Having Broadcasting and Gossiping Properties

    • Guillaume Fertin, André Raspaud
    Pages 63-77

  8. Optical All-to-All Communication in Inflated Networks

    • Olivier Togni
    Pages 78-87

  9. A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking

    • Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller
    Pages 88-99

  10. A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees

    • Shuji Isobe, Xiao Zhou, Takao Nishizeki
    Pages 100-113

  11. Rankings of Directed Graphs

    • Jan Kratochvíl, Zsolt Tuza
    Pages 114-123

  12. Drawing Planar Partitions II: HH-Drawings

    • Therese Biedl, Michael Kaufmann, Petra Mutzel
    Pages 124-136

  13. Triangles in Euclidean Arrangements

    • Stefan Felsner, Klaus Kriegel
    Pages 137-148

  14. Internally Typed Second-Order Term Graphs

    • Wolfram Kahl
    Pages 149-163

  15. Compact Implicit Representation of Graphs

    • Maurizio Talamo, Paola Vocca
    Pages 164-176

  16. Graphs with Bounded Induced Distance

    • Serafino Cicerone, Gabriele Di Stefano
    Pages 177-191

  17. Diameter Determination on Restricted Graph Families

    • Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul
    Pages 192-202

  18. Independent Tree Spanners

    • Dagmar Handke
    Pages 203-214

  19. Upgrading Bottleneck Constrained Forests

    • S. O. Krumke, M. V. Marathe, H. Noltemeier, S. S. Ravi, H. -C. Wirth
    Pages 215-226

  20. Routing in Recursive Circulant Graphs: Edge Forwarding Index and Hamiltonian Decomposition

    • G. Gauyacq, C. Micheneau, A. Raspaud
    Pages 227-241
Back to top

Other volumes

  1. Graph-Theoretic Concepts in Computer Science

Editors and Affiliations

  • Department of Computer Science, ETH Zurich, ETH Zentrum, Zurich, Switzerland

    Juraj Hromkovič

  • Department of Computer Science, University of Loughborough, Loughborough, UK

    Ondrej Sýkora

Accessibility Information

Accessibility information for this book is coming soon. We're working to make it available as quickly as possible. Thank you for your patience.

Bibliographic Information

Publish with us

Policies and ethics

Back to top