↓ Skip to main content

Combinatorial Algorithms

Overview of attention for book
Cover of 'Combinatorial Algorithms'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Speeding Up Cover Time of Sparse Graphs Using Local Knowledge
  3. Altmetric Badge
    Chapter 2 Minimum Activation Cost Edge-Disjoint Paths in Graphs with Bounded Tree-Width
  4. Altmetric Badge
    Chapter 3 A Fast Scaling Algorithm for the Weighted Triangle-Free 2-Matching Problem
  5. Altmetric Badge
    Chapter 4 1-Page and 2-Page Drawings with Bounded Number of Crossings per Edge
  6. Altmetric Badge
    Chapter 5 Longest Common Extensions in Partial Words
  7. Altmetric Badge
    Chapter 6 Adding Isolated Vertices Makes Some Online Algorithms Optimal
  8. Altmetric Badge
    Chapter 7 Gray Codes for AT-Free Orders via Antimatroids
  9. Altmetric Badge
    Chapter 8 Enumerating Cyclic Orientations of a Graph
  10. Altmetric Badge
    Chapter 9 Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs
  11. Altmetric Badge
    Chapter 10 Combinatorial Properties of Full-Flag Johnson Graphs
  12. Altmetric Badge
    Chapter 11 List Colouring and Partial List Colouring of Graphs On-line
  13. Altmetric Badge
    Chapter 12 About Ungatherability of Oblivious and Asynchronous Robots on Anonymous Rings
  14. Altmetric Badge
    Chapter 13 Dynamic Subtrees Queries Revisited: The Depth First Tour Tree
  15. Altmetric Badge
    Chapter 14 Schröder Partitions and Schröder Tableaux
  16. Altmetric Badge
    Chapter 15 Algorithmic Aspects of the S-Labeling Problem
  17. Altmetric Badge
    Chapter 16 Contagious Sets in Dense Graphs
  18. Altmetric Badge
    Chapter 17 Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time
  19. Altmetric Badge
    Chapter 18 On the Complexity of Rainbow Coloring Problems
  20. Altmetric Badge
    Chapter 19 How to Design Graphs with Low Forwarding Index and Limited Number of Edges
  21. Altmetric Badge
    Chapter 20 Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs
  22. Altmetric Badge
    Chapter 21 Fast Multiple Order-Preserving Matching Algorithms
  23. Altmetric Badge
    Chapter 22 Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees
  24. Altmetric Badge
    Chapter 23 A Faster FPTAS for the Unbounded Knapsack Problem
  25. Altmetric Badge
    Chapter 24 Computational Complexity of Distance Edge Labeling
  26. Altmetric Badge
    Chapter 25 1.5-Approximation Algorithm for the 2-Convex Recoloring Problem
  27. Altmetric Badge
    Chapter 26 Computing the BWT and the LCP Array in Constant Space
  28. Altmetric Badge
    Chapter 27 EERTREE: An Efficient Data Structure for Processing Palindromes in Strings
  29. Altmetric Badge
    Chapter 28 On the Zero Forcing Number of Bijection Graphs
  30. Altmetric Badge
    Chapter 29 The k-Leaf Spanning Tree Problem Admits a Klam Value of 39
Attention for Chapter 24: Computational Complexity of Distance Edge Labeling
Altmetric Badge

About this Attention Score

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

Mentioned by

3 tweeters

Readers on

2 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.
Chapter title
Computational Complexity of Distance Edge Labeling
Chapter number 24
Book title
Combinatorial Algorithms
Published in
arXiv, October 2015
DOI 10.1007/978-3-319-29516-9_24
Book ISBNs
978-3-31-929515-2, 978-3-31-929516-9

Dušan Knop, Tomáš Masařík

Twitter Demographics

The data shown below were collected from the profiles of 3 tweeters who shared this research output. Click here to find out more about how the information was compiled.

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 2 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 50%
Unknown 1 50%
Readers by discipline Count As %
Computer Science 2 100%

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 19 February 2018.
All research outputs
of 13,528,196 outputs
Outputs from arXiv
of 527,948 outputs
Outputs of similar age
of 264,292 outputs
Outputs of similar age from arXiv
of 20,524 outputs
Altmetric has tracked 13,528,196 research outputs across all sources so far. This one is in the 23rd percentile – i.e., 23% of other outputs scored the same or lower than it.
So far Altmetric has tracked 527,948 research outputs from this source. They receive a mean Attention Score of 3.7. This one has gotten more attention than average, scoring higher than 50% 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 264,292 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 32nd percentile – i.e., 32% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 20,524 others from the same source and published within six weeks on either side of this one. This one is in the 33rd percentile – i.e., 33% of its contemporaries scored the same or lower than it.