↓ 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 Algorithmic Barriers from Phase Transitions in Graphs
  3. Altmetric Badge
    Chapter 2 Algorithmic Graph Minors and Bidimensionality
  4. Altmetric Badge
    Chapter 3 Complexity Results for the Spanning Tree Congestion Problem
  5. Altmetric Badge
    Chapter 4 max-cut  and Containment Relations in Graphs
  6. Altmetric Badge
    Chapter 5 The Longest Path Problem is Polynomial on Cocomparability Graphs
  7. Altmetric Badge
    Chapter 6 Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds
  8. Altmetric Badge
    Chapter 7 On Stable Matchings and Flows
  9. Altmetric Badge
    Chapter 8 Narrowing Down the Gap on the Complexity of Coloring P k -Free Graphs
  10. Altmetric Badge
    Chapter 9 Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time
  11. Altmetric Badge
    Chapter 10 Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching
  12. Altmetric Badge
    Chapter 11 Efficient Algorithms for Eulerian Extension
  13. Altmetric Badge
    Chapter 12 On the Small Cycle Transversal of Planar Graphs
  14. Altmetric Badge
    Chapter 13 Milling a Graph with Turn Costs: A Parameterized Complexity Perspective
  15. Altmetric Badge
    Chapter 14 Graphs that Admit Right Angle Crossing Drawings
  16. Altmetric Badge
    Chapter 15 Kernelization Hardness of Connectivity Problems in d -Degenerate Graphs
  17. Altmetric Badge
    Chapter 16 On the Boolean-Width of a Graph: Structure and Applications
  18. Altmetric Badge
    Chapter 17 Generalized Graph Clustering: Recognizing ( p , q )-Cluster Graphs
  19. Altmetric Badge
    Chapter 18 Colouring Vertices of Triangle-Free Graphs
  20. Altmetric Badge
    Chapter 19 A Quartic Kernel for Pathwidth-One Vertex Deletion
  21. Altmetric Badge
    Chapter 20 Network Exploration by Silent and Oblivious Robots
  22. Altmetric Badge
    Chapter 21 Uniform Sampling of Digraphs with a Fixed Degree Sequence
  23. Altmetric Badge
    Chapter 22 Measuring Indifference: Unit Interval Vertex Deletion
  24. Altmetric Badge
    Chapter 23 Parameterized Complexity of the Arc-Preserving Subsequence Problem
  25. Altmetric Badge
    Chapter 24 From Path Graphs to Directed Path Graphs
  26. Altmetric Badge
    Chapter 25 Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
  27. Altmetric Badge
    Chapter 26 Efficient Broadcasting in Random Power Law Networks
  28. Altmetric Badge
    Chapter 27 Graphs with Large Obstacle Numbers
  29. Altmetric Badge
    Chapter 28 The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree
  30. Altmetric Badge
    Chapter 29 The Number of Bits Needed to Represent a Unit Disk Graph
  31. Altmetric Badge
    Chapter 30 Lattices and Maximum Flow Algorithms in Planar Graphs
Overall attention for this book and its chapters
Altmetric Badge

About this Attention Score

  • In the top 25% of all research outputs scored by Altmetric
  • High Attention Score compared to outputs of the same age (89th percentile)
  • High Attention Score compared to outputs of the same age and source (96th percentile)

Mentioned by

news
1 news outlet
blogs
1 blog

Citations

dimensions_citation
3 Dimensions

Readers on

mendeley
1 Mendeley
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.
Title
Graph Theoretic Concepts in Computer Science
Published by
ADS, November 2010
DOI 10.1007/978-3-642-16926-7
ISBNs
978-3-64-216925-0, 978-3-64-216926-7
Editors

Thilikos, Dimitrios M.

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 > Master 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 13. 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 24 February 2022.
All research outputs
#2,502,217
of 23,189,371 outputs
Outputs from ADS
#1,542
of 37,567 outputs
Outputs of similar age
#10,248
of 101,929 outputs
Outputs of similar age from ADS
#12
of 323 outputs
Altmetric has tracked 23,189,371 research outputs across all sources so far. Compared to these this one has done well and is in the 89th percentile: it's in the top 25% of all research outputs ever tracked by Altmetric.
So far Altmetric has tracked 37,567 research outputs from this source. They receive a mean Attention Score of 4.6. This one has done particularly well, scoring higher than 95% 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 101,929 tracked outputs that were published within six weeks on either side of this one in any source. This one has done well, scoring higher than 89% of its contemporaries.
We're also able to compare this research output to 323 others from the same source and published within six weeks on either side of this one. This one has done particularly well, scoring higher than 96% of its contemporaries.