Skip to main content
SpringerLink
Log in

Graph Theory and Algorithms

17th Symposium of Research Institute of Electrical Communication, Tohoku University, Sendai, Japan, October 24-25, 1980. Proceedings

  • Conference proceedings
  • © 1981

Overview

Editors:
  1. N. Saito
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. T. Nishizeki
    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 108)

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

Access this book

Log in via an institution
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

Table of contents (18 papers)

  1. Front Matter

    Download chapter PDF

  2. Dividing a system into almost unidirectional blocks

    • Wataru Mayeda
    Pages 1-8

  3. A linear algorithm for five-coloring a planar graph

    • N. Chiba, T. Nishizeki, N. Saito
    Pages 9-19

  4. On the layering problem of multilayer PWB wiring

    • S. Tsukiyama, E. S. Kuh, I. Shirakawa
    Pages 20-37

  5. A status on the linear arboricity

    • J. Akiyama
    Pages 38-44

  6. On centrality functions of a graph

    • G. Kishi
    Pages 45-52

  7. Canonical decompositions of symmetric submodular systems

    • S. Fujishige
    Pages 53-64

  8. The subgraph homeomorphism problem on reducible flow graphs

    • T. Hirata, M. Kimura
    Pages 65-78

  9. Combinatorial problems on series-parallel graphs

    • K. Takamizawa, T. Nishizeki, N. Saito
    Pages 79-94

  10. A graph-planarization algorithm and its application to random graphs

    • T. Ozawa, H. Takahashi
    Pages 95-107

  11. Some common properties for regularizable graphs, edge-critical graphs and b-graphs

    • Claude Berge
    Pages 108-123

  12. "Dualities" in graph theory and in the related fields viewed from the metatheoretical standpoint

    • M. Iri
    Pages 124-136

  13. On central trees of a graph

    • S. Shinoda, T. Kawamoto
    Pages 137-151

  14. On polynomial time computable problems

    • T. Kasai, A. Adachi
    Pages 152-158

  15. Homomorphisms of graphs and their global maps

    • Masakazu Nasu
    Pages 159-170

  16. Algorithms for some intersection graphs

    • T. Kashiwabara
    Pages 171-181

  17. An efficient algorithm to find a Hamiltonian circuit in a 4-connected maximal planar graph

    • T. Asano, S. Kikuchi, N. Saito
    Pages 182-195

  18. Characterization of polyhex graphs as applied to chemistry

    • H. Hosoya
    Pages 196-206

  19. The two disjoint path problem and wire routing design

    • T. Ohtsuki
    Pages 207-216
Back to top

Keywords

Bibliographic Information

  • Book Title: Graph Theory and Algorithms

  • Book Subtitle: 17th Symposium of Research Institute of Electrical Communication, Tohoku University, Sendai, Japan, October 24-25, 1980. Proceedings

  • Editors: N. Saito, T. Nishizeki

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/3-540-10704-5

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1981

  • Softcover ISBN: 978-3-540-10704-0Published: 01 May 1981

  • eBook ISBN: 978-3-540-38661-2Published: 29 June 2005

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: VIII, 220

  • Topics: Algorithm Analysis and Problem Complexity

Publish with us

Policies and ethics

Back to top

Search

Navigation