↓ 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 Hypergraphs and decision trees
  3. Altmetric Badge
    Chapter 2 Improved approximations of independent dominating set in bounded degree graphs
  4. Altmetric Badge
    Chapter 3 A new characterization of P 4 -connected graphs
  5. Altmetric Badge
    Chapter 4 Node rewriting in hypergraphs
  6. Altmetric Badge
    Chapter 5 On κ-partitioning the n-cube
  7. Altmetric Badge
    Chapter 6 Embedding complete binary trees in product graphs
  8. Altmetric Badge
    Chapter 7 Clique and anticlique partitions of graphs
  9. Altmetric Badge
    Chapter 8 Optimal parallel routing in star graphs
  10. Altmetric Badge
    Chapter 9 Counting edges in a dag
  11. Altmetric Badge
    Chapter 10 Closure properties of context-free Hyperedge Replacement Systems
  12. Altmetric Badge
    Chapter 11 Upward drawings of search trees
  13. Altmetric Badge
    Chapter 12 More general parallel tree contraction: Register allocation and broadcasting in a tree
  14. Altmetric Badge
    Chapter 13 System diagnosis with smallest risk of error
  15. Altmetric Badge
    Chapter 14 Efficient algorithms for shortest path queries in planar digraphs
  16. Altmetric Badge
    Chapter 15 LexBFS-orderings and powers of graphs
  17. Altmetric Badge
    Chapter 16 Efficient Union-Find for planar graphs and other sparse graph classes
  18. Altmetric Badge
    Chapter 17 Switchbox routing in VLSI design: Closing the complexity gap
  19. Altmetric Badge
    Chapter 18 Detecting diamond necklaces in labeled dags
  20. Altmetric Badge
    Chapter 19 Algebraic graph derivations for graphical calculi
  21. Altmetric Badge
    Chapter 20 Definability equals recognizability of partial 3-trees
  22. Altmetric Badge
    Chapter 21 One, two, three, many, or: Complexity aspects of dynamic network flows with dedicated arcs
  23. Altmetric Badge
    Chapter 22 Approximate maxima finding of continuous functions under restricted budget (Extended abstract)
  24. Altmetric Badge
    Chapter 23 The Optimal Cost Chromatic Partition problem for trees and interval graphs
  25. Altmetric Badge
    Chapter 24 Modifying networks to obtain low cost trees
  26. Altmetric Badge
    Chapter 25 On the hardness of allocating frequencies for hybrid networks
  27. Altmetric Badge
    Chapter 26 Homogeneous sets and domination problems
  28. Altmetric Badge
    Chapter 27 Independent spanning trees of product graphs
  29. Altmetric Badge
    Chapter 28 Designing distrance-preserving fault-tolerant topologies
  30. Altmetric Badge
    Chapter 29 Shortest path algorithms for nearly acyclic directed graphs
  31. Altmetric Badge
    Chapter 30 Computing disjoint paths with length constraints
  32. Altmetric Badge
    Chapter 31 Generalized edge-rankings of trees
Attention for Chapter 14: Efficient algorithms for shortest path queries in planar digraphs
Altmetric Badge

About this Attention Score

  • Average Attention Score compared to outputs of the same age and source

Mentioned by

q&a
1 Q&A thread

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
1 Mendeley
citeulike
1 CiteULike
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
Efficient algorithms for shortest path queries in planar digraphs
Chapter number 14
Book title
Graph-Theoretic Concepts in Computer Science
Published in
Lecture notes in computer science, January 1997
DOI 10.1007/3-540-62559-3_14
Book ISBNs
978-3-54-062559-9, 978-3-54-068072-7
Authors

Hristo N. Djidjev

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 %
Researcher 1 100%
Readers by discipline Count As %
Computer Science 1 100%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 3. 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 05 December 2010.
All research outputs
#12,853,669
of 22,664,267 outputs
Outputs from Lecture notes in computer science
#3,773
of 8,123 outputs
Outputs of similar age
#73,795
of 91,339 outputs
Outputs of similar age from Lecture notes in computer science
#13
of 20 outputs
Altmetric has tracked 22,664,267 research outputs across all sources so far. This one is in the 42nd percentile – i.e., 42% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,123 research outputs from this source. They receive a mean Attention Score of 5.0. This one has gotten more attention than average, scoring higher than 52% of its peers.
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 91,339 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 18th percentile – i.e., 18% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 20 others from the same source and published within six weeks on either side of this one. This one is in the 30th percentile – i.e., 30% of its contemporaries scored the same or lower than it.