↓ 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 New Directions in Approximate Nearest-Neighbor Searching
  3. Altmetric Badge
    Chapter 2 The Induced Star Partition of Graphs
  4. Altmetric Badge
    Chapter 3 Fault-Tolerant Additive Weighted Geometric Spanners
  5. Altmetric Badge
    Chapter 4 Maintaining the Visibility Graph of a Dynamic Simple Polygon
  6. Altmetric Badge
    Chapter 5 On the Bitprobe Complexity of Two Probe Adaptive Schemes Storing Two Elements
  7. Altmetric Badge
    Chapter 6 On m -Bonacci-Sum Graphs
  8. Altmetric Badge
    Chapter 7 Linear Time Algorithm to Check the Singularity of Block Graphs
  9. Altmetric Badge
    Chapter 8 b-Coloring of the Mycielskian of Regular Graphs
  10. Altmetric Badge
    Chapter 9 Drawing Bipartite Graphs in Two Layers with Specified Crossings
  11. Altmetric Badge
    Chapter 10 Minimal-Perimeter Polyominoes: Chains, Roots, and Algorithms
  12. Altmetric Badge
    Chapter 11 On Rectangle Intersection Graphs with Stab Number at Most Two
  13. Altmetric Badge
    Chapter 12 Dominating Induced Matching in Some Subclasses of Bipartite Graphs
  14. Altmetric Badge
    Chapter 13 Localized Query: Color Spanning Variations
  15. Altmetric Badge
    Chapter 14 A Lower Bound for the Radio Number of Graphs
  16. Altmetric Badge
    Chapter 15 Improved Descriptional Complexity Results on Generalized Forbidding Grammars
  17. Altmetric Badge
    Chapter 16 On Selecting Leaves with Disjoint Neighborhoods in Embedded Trees
  18. Altmetric Badge
    Chapter 17 The Balanced Connected Subgraph Problem
  19. Altmetric Badge
    Chapter 18 Covering and Packing of Triangles Intersecting a Straight Line
  20. Altmetric Badge
    Chapter 19 H -Free Coloring on Graphs with Bounded Tree-Width
  21. Altmetric Badge
    Chapter 20 The Relative Signed Clique Number of Planar Graphs is 8
  22. Altmetric Badge
    Chapter 21 Bumblebee Visitation Problem
  23. Altmetric Badge
    Chapter 22 On Graphs with Minimal Eternal Vertex Cover Number
  24. Altmetric Badge
    Chapter 23 On Chordal and Perfect Plane Triangulations
Attention for Chapter 14: A Lower Bound for the Radio Number of Graphs
Altmetric Badge

Mentioned by

twitter
2 X users

Readers on

mendeley
3 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
A Lower Bound for the Radio Number of Graphs
Chapter number 14
Book title
Algorithms and Discrete Applied Mathematics
Published in
arXiv, February 2019
DOI 10.1007/978-3-030-11509-8_14
Book ISBNs
978-3-03-011508-1, 978-3-03-011509-8
Authors

Devsi Bantva, Bantva, Devsi

X Demographics

X Demographics

The data shown below were collected from the profiles of 2 X users 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 3 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 3 100%

Demographic breakdown

Readers by professional status Count As %
Other 1 33%
Unknown 2 67%
Readers by discipline Count As %
Computer Science 1 33%
Unknown 2 67%
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 14 March 2019.
All research outputs
#19,246,640
of 23,852,579 outputs
Outputs from arXiv
#558,679
of 990,619 outputs
Outputs of similar age
#336,123
of 452,103 outputs
Outputs of similar age from arXiv
#14,165
of 24,741 outputs
Altmetric has tracked 23,852,579 research outputs across all sources so far. This one is in the 11th percentile – i.e., 11% of other outputs scored the same or lower than it.
So far Altmetric has tracked 990,619 research outputs from this source. They receive a mean Attention Score of 4.0. This one is in the 29th percentile – i.e., 29% 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 452,103 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 15th percentile – i.e., 15% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 24,741 others from the same source and published within six weeks on either side of this one. This one is in the 27th percentile – i.e., 27% of its contemporaries scored the same or lower than it.