Skip to main content
  • Conference proceedings
  • © 1981

Graph Theory and Algorithms

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

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

Buy it now

Buying options

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 (18 papers)

  1. Front Matter

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

    • N. Chiba, T. Nishizeki, N. Saito
    Pages 9-19
  3. On the layering problem of multilayer PWB wiring

    • S. Tsukiyama, E. S. Kuh, I. Shirakawa
    Pages 20-37
  4. A status on the linear arboricity

    • J. Akiyama
    Pages 38-44
  5. On centrality functions of a graph

    • G. Kishi
    Pages 45-52
  6. Combinatorial problems on series-parallel graphs

    • K. Takamizawa, T. Nishizeki, N. Saito
    Pages 79-94
  7. On central trees of a graph

    • S. Shinoda, T. Kawamoto
    Pages 137-151
  8. On polynomial time computable problems

    • T. Kasai, A. Adachi
    Pages 152-158
  9. Homomorphisms of graphs and their global maps

    • Masakazu Nasu
    Pages 159-170
  10. Algorithms for some intersection graphs

    • T. Kashiwabara
    Pages 171-181

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

Buy it now

Buying options

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