↓ Skip to main content

Algorithms and Computation

Overview of attention for book
Cover of 'Algorithms and Computation'

Table of Contents

  1. Book Overview
  2. Chapter 1 Chain Reconfiguration The Ins and Outs, Ups and Downs of Moving Polygons and Polygonal Linkages
  3. Chapter 2 Application of M-Convex Submodular Flow Problem to Mathematical Economics
  4. Chapter 3 A Polynomial Time Approximation Scheme for Minimizing Total Completion Time of Unbounded Batch Scheduling
  5. Chapter 4 A Polynomial Time Approximation Scheme for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times
  6. Chapter 5 Semi-normal Schedulings: Improvement on Goemans’ Algorithm
  7. Chapter 6 Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness
  8. Chapter 7 Broadcasting with Universal Lists Revisited: Using Competitive Analysis
  9. Chapter 8 On Adaptive Fault Diagnosis for Multiprocessor Systems
  10. Chapter 9 On-Line Multicasting in All-Optical Networks
  11. Chapter 10 Enumerating Floorplans with n Rooms
  12. Chapter 11 On Min-Max Cycle Bases
  13. Chapter 12 On the Minimum Local-Vertex-Connectivity Augmentation in Graphs
  14. Chapter 13 Counting Graph Isomorphisms among Chordal Graphs with Restricted Clique Number
  15. Chapter 14 Quantum Algorithms for Intersection and Proximity Problems
  16. Chapter 15 Algorithms and Computation
  17. Chapter 16 Approximation of Minimum Triangulation for Polyhedron with Bounded Degrees
  18. Chapter 17 Tree-Approximations for the Weighted Cost-Distance Problem
  19. Chapter 18 Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups
  20. Chapter 19 Generic Algorithms and Key Agreement Protocols Based on Group Actions
  21. Chapter 20 Baire Category and Nowhere Differentiability for Feasible Real Functions
  22. Chapter 21 Translation among CNFs, Characteristic Models and Ordered Binary Decision Diagrams
  23. Chapter 22 On Removing the Pushdown Stack in Reachability Constructions
  24. Chapter 23 A New Recognition Algorithm for Extended Regular Expressions
  25. Chapter 24 Polynomial-Time Algorithms for the Equivalence for One-Way Quantum Finite Automata
  26. Chapter 25 An Index for the Data Size to Extract Decomposable Structures in LAD
  27. Chapter 26 Parameterized Complexity: The Main Ideas and Some Research Frontiers
  28. Chapter 27 Tight Bounds on Maximal and Maximum Matchings
  29. Chapter 28 Recognition and Orientation Algorithms for P4-Comparability Graphs
  30. Chapter 29 Efficient Algorithms for k-Terminal Cuts on Planar Graphs
  31. Chapter 30 Polynomial Time Algorithms for Edge-Connectivity Augmentation of Hamiltonian Paths
  32. Chapter 31 Algorithms for Pattern Involvement in Permutations
  33. Chapter 32 A Fast Algorithm for Enumerating Bipartite Perfect Matchings
  34. Chapter 33 On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time
  35. Chapter 34 On the Complexity of Train Assignment Problems
  36. Chapter 35 A Combinatorial Toolbox for Protein Sequence Design and Landscape Analysis in the Grand Canonical Model
  37. Chapter 36 Complexity of Comparing Hidden Markov Models
  38. Chapter 37 DNA Self-Assembly For Constructing 3D Boxes
  39. Chapter 38 Exact Solutions for Closest String and Related Problems
  40. Chapter 39 Topological Peeling and Implementation
  41. Chapter 40 Image Segmentation with Monotonicity and Smoothness Constraints
  42. Chapter 41 Optimization Algorithms for Sweeping a Polygonal Region with Mobile Guards
  43. Chapter 42 Approximation of a Geometric Set Covering Problem
  44. Chapter 43 Shortest Path Algorithms: Engineering Aspects
  45. Chapter 44 Efficient Algorithms for Weighted Colorings of Series-Parallel Graphs
  46. Chapter 45 Go with the Winners Algorithms for Cliques in Random Graphs
  47. Chapter 46 Complexity of Partial Covers of Graphs
  48. Chapter 47 On Game-Theoretic Models of Networks
  49. Chapter 48 The Complexity of Some Basic Problems for Dynamic Process Graphs
  50. Chapter 49 Delay Optimizations in Quorum Consensus
  51. Chapter 50 Randomized Shared Queues Applied to Distributed Optimization Algorithms
  52. Chapter 51 Multiprocess Time Queue
  53. Chapter 52 Labeling Points with Weights
  54. Chapter 53 Small Convex Quadrangulations of Point Sets
  55. Chapter 54 How to Color a Checkerboard with a Given Distribution — Matrix Rounding Achieving Low 2 × 2-Discrepancy
  56. Chapter 55 Labeling Subway Lines
  57. Chapter 56 Complexity Study on Two Clustering Problems
  58. Chapter 57 A Modified Greedy Algorithm for the Set Cover Problem with Weights 1 and 2
  59. Chapter 58 A Unified Framework for Approximating Multiway Partition Problems
  60. Chapter 59 On-Line Algorithms for Cardinality Constrained Bin Packing Problems
  61. Chapter 60 Suffix Vector: A Space-Efficient Suffix Tree Representation
  62. Chapter 61 Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works
  63. Chapter 62 Computing the Quartet Distance between Evolutionary Trees in Time O ( n log 2 n )
  64. Chapter 63 The Cent-dian Path Problem on Tree Networks
  65. Chapter 64 Approximate Hotlink Assignment
  66. Chapter 65 Efficient Algorithms for Two Generalized 2-Median Problems on Trees
Attention for Chapter 29: Efficient Algorithms for k-Terminal Cuts on Planar Graphs

About this Attention Score

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

Mentioned by

q&a
1 Q&A thread

Readers on

mendeley
5 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.
Article details
Chapter title
Efficient Algorithms for k-Terminal Cuts on Planar Graphs
Chapter number 29
Book title
Algorithms and Computation
Published in
Lecture notes in computer science, January 2001
DOI 10.1007/3-540-45678-3_29
Book ISBNs
978-3-54-042985-2, 978-3-54-045678-0
Authors

Danny Z. Chen, Xiaodong Wu

Login to access the Attention Digest and the Sentiment Analysis related to this output.

Timeline Attention over time Attention Score history
Login to access the full charts related to this output.
Activity
Login to access the full charts related to this output.
Mendeley demographics

Mendeley demographics

The data shown below were compiled from readership statistics for 5 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Login to view Mendeley reader trends over time.

Geographical breakdown

Geographical breakdown
Country Count As %
Unknown 5 100%

Demographic breakdown

Readers by professional status
Readers by professional status Count As %
Professor > Associate Professor 3 60%
Student > Ph. D. Student 1 20%
Lecturer 1 20%
Readers by discipline
Readers by discipline Count As %
Computer Science 3 60%
Mathematics 1 20%
Agricultural and Biological Sciences 1 20%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 3. 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 November 2011.
All research outputs
#12,856,520
of 22,668,244 outputs
Outputs from Lecture notes in computer science
#3,773
of 8,123 outputs
Outputs of similar age
#94,378
of 113,940 outputs
Outputs of similar age from Lecture notes in computer science
#11
of 23 outputs
Altmetric has tracked 22,668,244 research outputs across all sources so far. This one is in the 42nd percentile – i.e., 42% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,123 research outputs from this source. They receive a mean Attention Score of 5.0. This one has gotten more attention than average, scoring higher than 51% 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 113,940 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 16th percentile – i.e., 16% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 23 others from the same source and published within six weeks on either side of this one. This one is in the 47th percentile – i.e., 47% of its contemporaries scored the same or lower than it.