↓ Skip to main content
What is this page? Embed badge

Graph Theory and Algorithms

Overview of attention for book
Cover of 'Graph Theory and Algorithms'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Dividing a system into almost unidirectional blocks
  3. Altmetric Badge
    Chapter 2 A linear algorithm for five-coloring a planar graph
  4. Altmetric Badge
    Chapter 3 On the layering problem of multilayer PWB wiring
  5. Altmetric Badge
    Chapter 4 A status on the linear arboricity
  6. Altmetric Badge
    Chapter 5 On centrality functions of a graph
  7. Altmetric Badge
    Chapter 6 Canonical decompositions of symmetric submodular systems
  8. Altmetric Badge
    Chapter 7 The subgraph homeomorphism problem on reducible flow graphs
  9. Altmetric Badge
    Chapter 8 Combinatorial problems on series-parallel graphs
  10. Altmetric Badge
    Chapter 9 A graph-planarization algorithm and its application to random graphs
  11. Altmetric Badge
    Chapter 10 Some common properties for regularizable graphs, edge-critical graphs and b-graphs
  12. Altmetric Badge
    Chapter 11 "Dualities" in graph theory and in the related fields viewed from the metatheoretical standpoint
  13. Altmetric Badge
    Chapter 12 On central trees of a graph
  14. Altmetric Badge
    Chapter 13 On polynomial time computable problems
  15. Altmetric Badge
    Chapter 14 Homomorphisms of graphs and their global maps
  16. Altmetric Badge
    Chapter 15 Algorithms for some intersection graphs
  17. Altmetric Badge
    Chapter 16 An efficient algorithm to find a Hamiltonian circuit in a 4-connected maximal planar graph
  18. Altmetric Badge
    Chapter 17 Characterization of polyhex graphs as applied to chemistry
  19. Altmetric Badge
    Chapter 18 The two disjoint path problem and wire routing design
Attention for Chapter 13: On polynomial time computable problems
Altmetric Badge

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
1 Mendeley
Summary Dimensions citations
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
On polynomial time computable problems
Chapter number 13
Book title
Graph Theory and Algorithms
Published by
Springer, Berlin, Heidelberg, January 1981
DOI 10.1007/3-540-10704-5_13
Book ISBNs
978-3-54-010704-0, 978-3-54-038661-2
Authors

T. Kasai, A. Adachi, Kasai, T., Adachi, A.

View on publisher site
Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 1 Mendeley reader of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 100%
Readers by discipline Count As %
Mathematics 1 100%

This page is provided by Altmetric.