Skip to main content
  • Conference proceedings
  • © 1998

Graph-Theoretic Concepts in Computer Science

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

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

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

Conference proceedings info: WG 1998.

Buy it now

Buying options

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

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

Table of contents (30 papers)

  1. Front Matter

    Pages I-X
  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. Broadcasting on Anonymous Unoriented Tori

    • Stefan Dobrev, Peter Ružička
    Pages 50-62
  6. Families of Graphs Having Broadcasting and Gossiping Properties

    • Guillaume Fertin, André Raspaud
    Pages 63-77
  7. A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees

    • Shuji Isobe, Xiao Zhou, Takao Nishizeki
    Pages 100-113
  8. Rankings of Directed Graphs

    • Jan Kratochvíl, Zsolt Tuza
    Pages 114-123
  9. Drawing Planar Partitions II: HH-Drawings

    • Therese Biedl, Michael Kaufmann, Petra Mutzel
    Pages 124-136
  10. Triangles in Euclidean Arrangements

    • Stefan Felsner, Klaus Kriegel
    Pages 137-148
  11. Internally Typed Second-Order Term Graphs

    • Wolfram Kahl
    Pages 149-163
  12. Compact Implicit Representation of Graphs

    • Maurizio Talamo, Paola Vocca
    Pages 164-176
  13. Graphs with Bounded Induced Distance

    • Serafino Cicerone, Gabriele Di Stefano
    Pages 177-191
  14. Diameter Determination on Restricted Graph Families

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

    • Dagmar Handke
    Pages 203-214
  16. Upgrading Bottleneck Constrained Forests

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

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

Bibliographic Information

Buy it now

Buying options

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