↓ Skip to main content

Graph-Theoretic Concepts in Computer Science

Overview of attention for book
Cover of 'Graph-Theoretic Concepts in Computer Science'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Approximating treewidth, pathwidth, and minimum elimination tree height
  3. Altmetric Badge
    Chapter 2 Monadic second-order evaluations on tree-decomposable graphs
  4. Altmetric Badge
    Chapter 3 Optimal embedding of complete binary trees into lines and grids
  5. Altmetric Badge
    Chapter 4 Graph rewriting systems and their application to network reliability analysis
  6. Altmetric Badge
    Chapter 5 Nondeterministic control structures for graph rewriting systems
  7. Altmetric Badge
    Chapter 6 A language for generic graph-transformations
  8. Altmetric Badge
    Chapter 7 Attributed elementary programmed graph grammars
  9. Altmetric Badge
    Chapter 8 The complexity of approximating the class Steiner tree problem
  10. Altmetric Badge
    Chapter 9 On complexity of some chain and antichain partition problems
  11. Altmetric Badge
    Chapter 10 Tight bounds for the rectangular art gallery problem
  12. Altmetric Badge
    Chapter 11 Voronoi diagrams of moving points in the plane
  13. Altmetric Badge
    Chapter 12 Using maximal independent sets to solve problems in parallel
  14. Altmetric Badge
    Chapter 13 Fast parallel algorithms for coloring random graphs
  15. Altmetric Badge
    Chapter 14 Optimal vertex ordering of a graph and its application to symmetry detection
  16. Altmetric Badge
    Chapter 15 Edge separators for graphs of bounded genus with applications
  17. Altmetric Badge
    Chapter 16 Line digraph iterations and the spread concept—with application to graph theory, fault tolerance, and routing
  18. Altmetric Badge
    Chapter 17 A generalized encryption scheme based on random graphs
  19. Altmetric Badge
    Chapter 18 Dynamic algorithms for shortest paths in planar graphs
  20. Altmetric Badge
    Chapter 19 Complete problems for logspace involving lexicographic first paths in graphs
  21. Altmetric Badge
    Chapter 20 A new upper bound on the complexity of the all pairs shortest path problem
  22. Altmetric Badge
    Chapter 21 On the crossing number of the hypercube and the cube connected cycles
  23. Altmetric Badge
    Chapter 22 Logic arrays for interval indicator functions
  24. Altmetric Badge
    Chapter 23 On the broadcast time of the butterfly network
  25. Altmetric Badge
    Chapter 24 On disjoint cycles
  26. Altmetric Badge
    Chapter 25 Short disjoint cycles in cubic bridgeless graphs
Attention for Chapter 20: A new upper bound on the complexity of the all pairs shortest path problem
Altmetric Badge

Mentioned by

twitter
1 X user

Citations

dimensions_citation
1 Dimensions
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
A new upper bound on the complexity of the all pairs shortest path problem
Chapter number 20
Book title
Graph-Theoretic Concepts in Computer Science
Published in
Lecture notes in computer science, June 1991
DOI 10.1007/3-540-55121-2_20
Book ISBNs
978-3-54-055121-8, 978-3-54-046735-9
Authors

Tadao Takaoka, Takaoka, Tadao

X Demographics

X Demographics

The data shown below were collected from the profile of 1 X user who shared this research output. Click here to find out more about how the information was compiled.
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 1. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 12 July 2014.
All research outputs
#15,302,478
of 22,758,248 outputs
Outputs from Lecture notes in computer science
#4,648
of 8,126 outputs
Outputs of similar age
#15,959
of 17,113 outputs
Outputs of similar age from Lecture notes in computer science
#1
of 1 outputs
Altmetric has tracked 22,758,248 research outputs across all sources so far. This one is in the 22nd percentile – i.e., 22% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,126 research outputs from this source. They receive a mean Attention Score of 5.0. This one is in the 27th percentile – i.e., 27% of its peers scored the same or lower than it.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 17,113 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 3rd percentile – i.e., 3% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 1 others from the same source and published within six weeks on either side of this one. This one has scored higher than all of them