↓ Skip to main content

Computing and Combinatorics

Overview of attention for book
Cover of 'Computing and Combinatorics'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 The Assembly of the Human and Mouse Genomes
  3. Altmetric Badge
    Chapter 2 Data Structures for One-Dimensional Packet Classification Using Most-Specific-Rule Matching
  4. Altmetric Badge
    Chapter 3 DNA Complementarity and Paradigms of Computing
  5. Altmetric Badge
    Chapter 4 On Higher Arthur-Merlin Classes
  6. Altmetric Badge
    Chapter 5 (2 + f(n))-SAT and Its Properties
  7. Altmetric Badge
    Chapter 6 On the Minimal Polynomial of a Matrix
  8. Altmetric Badge
    Chapter 7 Computable Real Functions of Bounded Variation and Semi-computable Real Numbers
  9. Altmetric Badge
    Chapter 8 Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
  10. Altmetric Badge
    Chapter 9 Coloring Algorithms on Subcubic Graphs
  11. Altmetric Badge
    Chapter 10 Efficient Algorithms for the Hamiltonian Problem on Distance-Hereditary Graphs
  12. Altmetric Badge
    Chapter 11 Extending the Accommodating Function
  13. Altmetric Badge
    Chapter 12 Inverse Parametric Sequence Alignment
  14. Altmetric Badge
    Chapter 13 The Full Steiner Tree Problem in Phylogeny
  15. Altmetric Badge
    Chapter 14 Inferring a Union of Halfspaces from Examples
  16. Altmetric Badge
    Chapter 15 Dictionary Look-Up within Small Edit Distance
  17. Altmetric Badge
    Chapter 16 Polynomial Interpolation of the Elliptic Curve and XTR Discrete Logarithm
  18. Altmetric Badge
    Chapter 17 Co-orthogonal Codes
  19. Altmetric Badge
    Chapter 18 Efficient Power-Sum Systolic Architectures for Public-Key Cryptosystems in GF(2m)
  20. Altmetric Badge
    Chapter 19 Computing and Combinatorics
  21. Altmetric Badge
    Chapter 20 Solving Constraint Satisfaction Problems with DNA Computing
  22. Altmetric Badge
    Chapter 21 New Architecture and Algorithms for Degradable VLSI/WSI Arrays
  23. Altmetric Badge
    Chapter 22 Cluster: A Fast Tool to Identify Groups of Similar Programs
  24. Altmetric Badge
    Chapter 23 Broadcasting in Generalized de Bruijn Digraphs
  25. Altmetric Badge
    Chapter 24 On the Connected Domination Number of Random Regular Graphs
  26. Altmetric Badge
    Chapter 25 On the Number of Minimum Cuts in a Graph
  27. Altmetric Badge
    Chapter 26 On Crossing Numbers of 5-Regular Graphs
  28. Altmetric Badge
    Chapter 27 Maximum Flows and Critical Vertices in AND/OR Graphs
  29. Altmetric Badge
    Chapter 28 New Energy-Efficient Permutation Routing Protocol for Single-Hop Radio Networks
  30. Altmetric Badge
    Chapter 29 Simple Mutual Exclusion Algorithms Based on Bounded Tickets on the Asynchronous Shared Memory Model
  31. Altmetric Badge
    Chapter 30 Time and Energy Optimal List Ranking Algorithms on the k-Channel Broadcast Communication Model
  32. Altmetric Badge
    Chapter 31 Energy-Efficient Size Approximation of Radio Networks with No Collision Detection
  33. Altmetric Badge
    Chapter 32 A New Class of Symbolic Abstract Neural Nets: Tissue P Systems
  34. Altmetric Badge
    Chapter 33 Transducers with Set Output
  35. Altmetric Badge
    Chapter 34 Self-assembling Finite Automata
  36. Altmetric Badge
    Chapter 35 Repetition Complexity of Words
  37. Altmetric Badge
    Chapter 36 Using PageRank to Characterize Web Structure
  38. Altmetric Badge
    Chapter 37 On Randomized Broadcasting and Gossiping in Radio Networks
  39. Altmetric Badge
    Chapter 38 Fast and Dependable Communication in Hyper-rings
  40. Altmetric Badge
    Chapter 39 The On-Line Heilbronn’s Triangle Problem in Three and Four Dimensions
  41. Altmetric Badge
    Chapter 40 Algorithms for Normal Curves and Surfaces
  42. Altmetric Badge
    Chapter 41 Terrain Polygon Decomposition, with Application to Layered Manufacturing
  43. Altmetric Badge
    Chapter 42 Supertrees by Flipping
  44. Altmetric Badge
    Chapter 43 A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays
  45. Altmetric Badge
    Chapter 44 Sharpening Occam’s Razor
  46. Altmetric Badge
    Chapter 45 Approximating 3D Points with Cylindrical Segments
  47. Altmetric Badge
    Chapter 46 Algorithms for the Multicolorings of Partial k-Trees
  48. Altmetric Badge
    Chapter 47 A Fault-Tolerant Merge Sorting Algorithm
  49. Altmetric Badge
    Chapter 48 2-Compromise Usability in 1-Dimensional Statistical Databases
  50. Altmetric Badge
    Chapter 49 An Experimental Study and Comparison of Topological Peeling and Topological Walk
  51. Altmetric Badge
    Chapter 50 On-Line Maximizing the Number of Items Packed in Variable-Sized Bins
  52. Altmetric Badge
    Chapter 51 On-Line Grid-Packing with a Single Active Grid
  53. Altmetric Badge
    Chapter 52 Bend Minimization in Orthogonal Drawings Using Integer Programming
  54. Altmetric Badge
    Chapter 53 The Conditional Location of a Median Path
  55. Altmetric Badge
    Chapter 54 New Results on the k-Truck Problem
  56. Altmetric Badge
    Chapter 55 Theory of Equal-Flows in Networks
  57. Altmetric Badge
    Chapter 56 Minimum Back-Walk-Free Latency Problem
  58. Altmetric Badge
    Chapter 57 Counting Satisfying Assignments in 2-SAT and 3-SAT
  59. Altmetric Badge
    Chapter 58 On the Maximum Number of Irreducible Coverings of an n-Vertex Graph by n — 3 Cliques
  60. Altmetric Badge
    Chapter 59 On Reachability in Graphs with Bounded Independence Number
  61. Altmetric Badge
    Chapter 60 Computing and Combinatorics
  62. Altmetric Badge
    Chapter 61 Probabilistic Reversible Automata and Quantum Automata
  63. Altmetric Badge
    Chapter 62 Quantum versus Deterministic Counter Automata
  64. Altmetric Badge
    Chapter 63 Quantum DNF Learnability Revisited
Attention for Chapter 36: Using PageRank to Characterize Web Structure
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 (71st percentile)
  • Good Attention Score compared to outputs of the same age and source (71st percentile)

Mentioned by

blogs
1 blog

Citations

dimensions_citation
3 Dimensions

Readers on

mendeley
45 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
Using PageRank to Characterize Web Structure
Chapter number 36
Book title
Computing and Combinatorics
Published in
Lecture notes in computer science, August 2002
DOI 10.1007/3-540-45655-4_36
Book ISBNs
978-3-54-043996-7, 978-3-54-045655-1
Authors

Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
United States 4 9%
United Kingdom 2 4%
Greece 2 4%
Korea, Republic of 1 2%
Spain 1 2%
Unknown 35 78%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 14 31%
Student > Master 7 16%
Professor > Associate Professor 5 11%
Researcher 5 11%
Student > Doctoral Student 2 4%
Other 9 20%
Unknown 3 7%
Readers by discipline Count As %
Computer Science 26 58%
Mathematics 3 7%
Engineering 3 7%
Social Sciences 3 7%
Agricultural and Biological Sciences 2 4%
Other 3 7%
Unknown 5 11%
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 15 August 2007.
All research outputs
#5,622,449
of 22,711,645 outputs
Outputs from Lecture notes in computer science
#1,789
of 8,124 outputs
Outputs of similar age
#12,592
of 44,613 outputs
Outputs of similar age from Lecture notes in computer science
#11
of 39 outputs
Altmetric has tracked 22,711,645 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,124 research outputs from this source. They receive a mean Attention Score of 5.0. This one has done well, scoring higher than 77% 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 44,613 tracked outputs that were published within six weeks on either side of this one in any source. This one has gotten more attention than average, scoring higher than 71% of its contemporaries.
We're also able to compare this research output to 39 others from the same source and published within six weeks on either side of this one. This one has gotten more attention than average, scoring higher than 71% of its contemporaries.