↓ Skip to main content

Algorithms and Discrete Applied Mathematics

Overview of attention for book
Cover of 'Algorithms and Discrete Applied Mathematics'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Probabilistic Arguments in Graph Coloring (Invited Talk)
  3. Altmetric Badge
    Chapter 2 A PTAS for the Metric Case of the Minimum Sum-Requirement Communication Spanning Tree Problem
  4. Altmetric Badge
    Chapter 3 Constant Approximation for Broadcasting in k-cycle Graph
  5. Altmetric Badge
    Chapter 4 Three Paths to Point Placement
  6. Altmetric Badge
    Chapter 5 Vertex Guarding in Weak Visibility Polygons
  7. Altmetric Badge
    Chapter 6 On Collections of Polygons Cuttable with a Segment Saw
  8. Altmetric Badge
    Chapter 7 Rectilinear Path Problems in Restricted Memory Setup
  9. Altmetric Badge
    Chapter 8 New Polynomial Case for Efficient Domination in P 6-free Graphs
  10. Altmetric Badge
    Chapter 9 Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties
  11. Altmetric Badge
    Chapter 10 Separator Theorems for Interval Graphs and Proper Interval Graphs
  12. Altmetric Badge
    Chapter 11 Bounds for the b-chromatic Number of Induced Subgraphs and G − e
  13. Altmetric Badge
    Chapter 12 New Characterizations of Proper Interval Bigraphs and Proper Circular Arc Bigraphs
  14. Altmetric Badge
    Chapter 13 On Spectra of Corona Graphs
  15. Altmetric Badge
    Chapter 14 Axiomatic Characterization of the Median and Antimedian Functions on Cocktail-Party Graphs and Complete Graphs
  16. Altmetric Badge
    Chapter 15 Tree Path Labeling of Hypergraphs – A Generalization of the Consecutive Ones Property
  17. Altmetric Badge
    Chapter 16 On a Special Class of Boxicity 2 Graphs
  18. Altmetric Badge
    Chapter 17 Domination in Some Subclasses of Bipartite Graphs
  19. Altmetric Badge
    Chapter 18 Parameterized Analogues of Probabilistic Computation
  20. Altmetric Badge
    Chapter 19 Algebraic Expressions of Rhomboidal Graphs
  21. Altmetric Badge
    Chapter 20 Solving Hamiltonian Cycle by an EPT Algorithm for a Non-sparse Parameter
  22. Altmetric Badge
    Chapter 21 Associativity for Binary Parallel Processes: A Quantitative Study
  23. Altmetric Badge
    Chapter 22 A Tight Bound for Congestion of an Embedding
  24. Altmetric Badge
    Chapter 23 Auction/Belief Propagation Algorithms for Constrained Assignment Problem
  25. Altmetric Badge
    Chapter 24 Bi-directional Search for Skyline Probability
  26. Altmetric Badge
    Chapter 25 Cumulative Vehicle Routing Problem: A Column Generation Approach
  27. Altmetric Badge
    Chapter 26 Energy Efficient Sweep Coverage with Mobile and Static Sensors
  28. Altmetric Badge
    Chapter 27 Generation of Random Digital Curves Using Combinatorial Techniques
Attention for Chapter 15: Tree Path Labeling of Hypergraphs – A Generalization of the Consecutive Ones Property
Altmetric Badge

Mentioned by

twitter
1 X user
facebook
1 Facebook page

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
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
Tree Path Labeling of Hypergraphs – A Generalization of the Consecutive Ones Property
Chapter number 15
Book title
Algorithms and Discrete Applied Mathematics
Published in
Lecture notes in computer science, February 2015
DOI 10.1007/978-3-319-14974-5_15
Book ISBNs
978-3-31-914973-8, 978-3-31-914974-5
Authors

N. S. Narayanaswamy, Anju Srinivasan

Editors

Sumit Ganguly, Ramesh Krishnamurti

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.
Mendeley readers

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 %
Neuroscience 1 50%
Unknown 1 50%
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 27 February 2015.
All research outputs
#17,743,050
of 22,785,242 outputs
Outputs from Lecture notes in computer science
#5,925
of 8,124 outputs
Outputs of similar age
#243,227
of 353,667 outputs
Outputs of similar age from Lecture notes in computer science
#171
of 232 outputs
Altmetric has tracked 22,785,242 research outputs across all sources so far. This one is in the 19th percentile – i.e., 19% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,124 research outputs from this source. They receive a mean Attention Score of 5.0. This one is in the 26th percentile – i.e., 26% 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 353,667 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 27th percentile – i.e., 27% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 232 others from the same source and published within six weeks on either side of this one. This one is in the 24th percentile – i.e., 24% of its contemporaries scored the same or lower than it.