↓ 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 On the Expected Runtime and the Success Probability of Evolutionary Algorithms (Invited Presentation)
  3. Altmetric Badge
    Chapter 2 n Points and One Line: Analysis of Randomized Games (Abstract of Invited Lecture)
  4. Altmetric Badge
    Chapter 3 Approximating Call-Scheduling Makespan in All-Optical Networks
  5. Altmetric Badge
    Chapter 4 New Spectral Lower Bounds on the Bisection Width of Graphs
  6. Altmetric Badge
    Chapter 5 Traversing Directed Eulerian Mazes (Extended Abstract)
  7. Altmetric Badge
    Chapter 6 On the Space and Access Complexity of Computation DAGs
  8. Altmetric Badge
    Chapter 7 Approximating the Treewidth of AT-Free Graphs
  9. Altmetric Badge
    Chapter 8 Split-Perfect Graphs: Characterizations and Algorithmic Use
  10. Altmetric Badge
    Chapter 9 Coarse Grained Parallel Algorithms for Detecting Convex Bipartite Graphs
  11. Altmetric Badge
    Chapter 10 Networks with Small Stretch Number (Extended Abstract)
  12. Altmetric Badge
    Chapter 11 Efficient Dispersion Algorithms for Geometric Intersection Graphs
  13. Altmetric Badge
    Chapter 12 Optimizing Cost Flows by Modifying Arc Costs and Capacities
  14. Altmetric Badge
    Chapter 13 Update Networks and Their Routing Strategies
  15. Altmetric Badge
    Chapter 14 Computing Input Multiplicity in Anonymous Synchronous Networks with Dynamic Faults
  16. Altmetric Badge
    Chapter 15 Diameter of the Knödel Graph
  17. Altmetric Badge
    Chapter 16 On the Domination Search Number
  18. Altmetric Badge
    Chapter 17 Efficient Communication in Unknown Networks
  19. Altmetric Badge
    Chapter 18 Graph Coloring on a Coarse Grained Multiprocessor (Extended Abstract)
  20. Altmetric Badge
    Chapter 19 The Tree-Width of Clique-Width Bounded Graphs without Kn,n
  21. Altmetric Badge
    Chapter 20 Tree Spanners for Subgraphs and Related Tree Covering Problems
  22. Altmetric Badge
    Chapter 21 Minimal Size of Piggybacked Information for Tracking Causality: A Graph-Based Characterization
  23. Altmetric Badge
    Chapter 22 The Expressive Power and Complexity of Dynamic Process Graphs
  24. Altmetric Badge
    Chapter 23 Bandwidth of Split and Circular Permutation Graphs
  25. Altmetric Badge
    Chapter 24 Recognizing Graphs without Asteroidal Triples (Extended Abstract)
  26. Altmetric Badge
    Chapter 25 Budget Constrained Minimum Cost Connected Medians
  27. Altmetric Badge
    Chapter 26 Coloring Mixed Hypertrees
  28. Altmetric Badge
    Chapter 27 A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs
  29. Altmetric Badge
    Chapter 28 Optimal Fault-Tolerant Routings for k-Connected Graphs with Smaller Routing Tables
Overall attention for this book and its chapters
Altmetric Badge

About this Attention Score

  • Good Attention Score compared to outputs of the same age (69th percentile)
  • High Attention Score compared to outputs of the same age and source (82nd percentile)

Mentioned by

4 Wikipedia pages
1 Google+ user


4 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.
Graph-Theoretic Concepts in Computer Science
Published by
Lecture notes in computer science, July 2000
DOI 10.1007/3-540-40064-8
978-3-54-041183-3, 978-3-54-040064-6

Ulrik Brandes, Dorothea Wagner


Ulrik Brandes, Dorothea Wagner

Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 4. 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 04 January 2024.
All research outputs
of 22,880,691 outputs
Outputs from Lecture notes in computer science
of 8,129 outputs
Outputs of similar age
of 38,259 outputs
Outputs of similar age from Lecture notes in computer science
of 17 outputs
Altmetric has tracked 22,880,691 research outputs across all sources so far. This one has received more attention than most of these and is in the 70th percentile.
So far Altmetric has tracked 8,129 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 72% 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 38,259 tracked outputs that were published within six weeks on either side of this one in any source. This one has gotten more attention than average, scoring higher than 69% of its contemporaries.
We're also able to compare this research output to 17 others from the same source and published within six weeks on either side of this one. This one has done well, scoring higher than 82% of its contemporaries.