↓ Skip to main content

Frontiers in Algorithmics

Overview of attention for book
Cover of 'Frontiers in Algorithmics'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Broadcast Problem in Hypercube of Trees
  3. Altmetric Badge
    Chapter 2 Direct and Certifying Recognition of Normal Helly Circular-Arc Graphs in Linear Time
  4. Altmetric Badge
    Chapter 3 A Fixed-Parameter Approach for Privacy-Protection with Global Recoding
  5. Altmetric Badge
    Chapter 4 A Circular Matrix-Merging Algorithm with Application in VMAT Radiation Therapy
  6. Altmetric Badge
    Chapter 5 Engineering Algorithms for Workflow Satisfiability Problem with User-Independent Constraints
  7. Altmetric Badge
    Chapter 6 The Complexity of Zero-Visibility Cops and Robber
  8. Altmetric Badge
    Chapter 7 Combining Edge Weight and Vertex Weight for Minimum Vertex Cover Problem
  9. Altmetric Badge
    Chapter 8 Randomized Parameterized Algorithms for Co-path Set Problem
  10. Altmetric Badge
    Chapter 9 Improved LP-rounding Approximations for the k -Disjoint Restricted Shortest Paths Problem
  11. Altmetric Badge
    Chapter 10 Monotone Grid Drawings of Planar Graphs
  12. Altmetric Badge
    Chapter 11 Spanning Distribution Forests of Graphs
  13. Altmetric Badge
    Chapter 12 A (1.408+ ε )-Approximation Algorithm for Sorting Unsigned Genomes by Reciprocal Translocations
  14. Altmetric Badge
    Chapter 13 Space-Efficient Approximate String Matching Allowing Inversions in Fast Average Time
  15. Altmetric Badge
    Chapter 14 Minimal Double Dominating Sets in Trees
  16. Altmetric Badge
    Chapter 15 Parallel-Machine Scheduling Problem under the Job Rejection Constraint
  17. Altmetric Badge
    Chapter 16 Approximation Algorithms on Consistent Dynamic Map Labeling
  18. Altmetric Badge
    Chapter 17 The PoA of Scheduling Game with Machine Activation Costs
  19. Altmetric Badge
    Chapter 18 Approximation Algorithms for Bandwidth Consecutive Multicolorings
  20. Altmetric Badge
    Chapter 19 Improved Approximation Algorithm for Maximum Agreement Forest of Two Trees
  21. Altmetric Badge
    Chapter 20 Oblivious Integral Routing for Minimizing the Quadratic Polynomial Cost
  22. Altmetric Badge
    Chapter 21 Finding Simple Paths on Given Points in a Polygonal Region
  23. Altmetric Badge
    Chapter 22 Near Optimal Algorithms for Online Maximum Weighted b -Matching
  24. Altmetric Badge
    Chapter 23 Tree Convex Bipartite Graphs: $\mathcal{NP}$ -Complete Domination, Hamiltonicity and Treewidth
  25. Altmetric Badge
    Chapter 24 Zero-Sum Flow Numbers of Triangular Grids
  26. Altmetric Badge
    Chapter 25 A Study of Pure Random Walk Algorithms on Constraint Satisfaction Problems with Growing Domains
  27. Altmetric Badge
    Chapter 26 Calculating the Crossing Probability on the Square Tessellation of a Connection Game with Random Move Order: The Algorithm and Its Complexity
  28. Altmetric Badge
    Chapter 27 On Star-Cover and Path-Cover of a Tree
  29. Altmetric Badge
    Chapter 28 On the Complexity of Constrained Sequences Alignment Problems
  30. Altmetric Badge
    Chapter 29 On the Advice Complexity of One-Dimensional Online Bin Packing
  31. Altmetric Badge
    Chapter 30 Dynamic Matchings in Left Weighted Convex Bipartite Graphs
Attention for Chapter 19: Improved Approximation Algorithm for Maximum Agreement Forest of Two Trees
Altmetric Badge

About this Attention Score

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

Mentioned by

blogs
1 blog

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
Improved Approximation Algorithm for Maximum Agreement Forest of Two Trees
Chapter number 19
Book title
Frontiers in Algorithmics
Published in
Lecture notes in computer science, June 2014
DOI 10.1007/978-3-319-08016-1_19
Book ISBNs
978-3-31-908015-4, 978-3-31-908016-1
Authors

Feng Shi, Jie You, Qilong Feng, Shi, Feng, You, Jie, Feng, Qilong

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 > Postgraduate 1 50%
Unknown 1 50%
Readers by discipline Count As %
Agricultural and Biological Sciences 1 50%
Unknown 1 50%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 6. 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 28 June 2014.
All research outputs
#5,589,986
of 22,757,541 outputs
Outputs from Lecture notes in computer science
#1,767
of 8,126 outputs
Outputs of similar age
#52,280
of 227,594 outputs
Outputs of similar age from Lecture notes in computer science
#30
of 164 outputs
Altmetric has tracked 22,757,541 research outputs across all sources so far. Compared to these this one has done well and is in the 75th percentile: it's in the top 25% of all research outputs ever tracked by Altmetric.
So far Altmetric has tracked 8,126 research outputs from this source. They receive a mean Attention Score of 5.0. This one has done well, scoring higher than 78% 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 227,594 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 77% of its contemporaries.
We're also able to compare this research output to 164 others from the same source and published within six weeks on either side of this one. This one has done well, scoring higher than 81% of its contemporaries.