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

Graph-Theoretic Concepts in Computer Science

16th International Workshop WG '90, Berlin, Germany, June 20-22, 1990

Editors:

  1. Rolf H. Möhring
    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 484)

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

Conference proceedings info: WG 1990.

Sections

Softcover Book USD 109.00
Price excludes VAT (USA)
Learn about institutional subscriptions

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

Table of contents (26 papers)

  1. Front Matter

    PDF

  2. Optimal parallel algorithms for sparse graphs

    • Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis
    Pages 1-17

  3. Finding minimally weighted subgraphs

    • Jürgen Plehn, Bernd Voigt
    Pages 18-29

  4. On the complexity of some coloring games

    • Hans L. Bodlaender
    Pages 30-40

  5. A generalized best-first search method in graphs

    • Ulrich Huckenbeck, Detlev Ruland
    Pages 41-60

  6. Avoiding matrix multiplication

    • Tze-Heng Ma, Jeremy P. Spinrad
    Pages 61-71

  8. On feedback problems in planar digraphs

    • Hermann Stamm
    Pages 79-89

  9. Recognizing binary hamming graphs in O(n 2 log n) time

    • Franz Aurenhammer, Johann Hagauer
    Pages 90-98

  10. Vertex-disjoint trees and boundary single-layer routing

    • Kuo-Feng Liao, Majid Sarrafzadeh
    Pages 99-108

  12. Two polynomial problems in PLA folding

    • Claudio Arbib
    Pages 119-129

  13. The VLSI layout problem in various embedding models

    • Michael Formann, Frank Wagner
    Pages 130-139

  15. Deterministic message routing in faulty hypercubes

    • Seshu Madhavapeddy, I. Hal Sudborough
    Pages 154-169

  16. On complexity of a message-routing strategy for multicomputer systems

    • Hyeong-Ah Choi, Abdol-Hossein Esfahanian
    Pages 170-181

  18. Diagnosis of t/s-diagnosable systems

    • A. Das, K. Thulasiraman
    Pages 193-205

  19. Deciding 1-solvability of distributed task is NP-hard

    • Ofer Biran, Shlomo Moran, Shmuel Zaks
    Pages 206-220

  20. Remarks on some concurrency measures

    • M. Habib, M. Morvan, J. X. Rampon
    Pages 221-238
Back to top

Other Volumes

  1. Graph-Theoretic Concepts in Computer Science

Back to top

About this book

This volume gives the proceedings of WG '90, the 16th in a series of workshops. The aim of the workshop series is to contribute to integration in computer science by applying graph-theoretic concepts. The workshops are unusual in that they combine theoretical aspects with practice and applications. The volume is organized into sections on: - Graph algorithms and complexity, - VLSI layout, - Multiprocessor systems and concurrency, - Computational geometry, - Graphs, languages and databases, - Graph grammars. The volume contains revised versions of nearly all the papers presented at the workshop. Several papers take the form of preliminary reports on ongoing research.
Back to top

Keywords

  • Algorithmus
  • Concurrency
  • Graph theory
  • Graphentheorie
  • Komplexität
  • Parallelität
  • VLSI technology
  • VLSI-Technologie
  • algorithms
  • automata
  • complexity
  • databases
  • geometry
  • logic
  • vertices
  • algorithm analysis and problem complexity
  • combinatorics
  • data structures
Back to top

Bibliographic Information

  • Book Title: Graph-Theoretic Concepts in Computer Science

  • Book Subtitle: 16th International Workshop WG '90, Berlin, Germany, June 20-22, 1990

  • Editors: Rolf H. Möhring

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/3-540-53832-1

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1991

  • Softcover ISBN: 978-3-540-53832-5Published: 24 April 1991

  • eBook ISBN: 978-3-540-46310-8Published: 02 July 2005

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: XIII, 367

  • Topics: Theory of Computation, Algorithms, Discrete Mathematics, Data Science, Logic Design

Back to top
Access via your institution
Softcover Book USD 109.00
Price excludes VAT (USA)
Learn about institutional subscriptions