Sciweavers

2079 search results - page 142 / 416
» Universality of random graphs
Sort
View
ITA
2006
163views Communications» more  ITA 2006»
15 years 4 months ago
Graph fibrations, graph isomorphism, and PageRank
PageRank is a ranking method that assigns scores to web pages using the limit distribution of a random walk on the web graph. A fibration of graphs is a morphism that is a local i...
Paolo Boldi, Violetta Lonati, Massimo Santini, Seb...
GD
1997
Springer
15 years 8 months ago
Orthogonal 3-D Graph Drawing
This paper studies 3-D orthogonal grid drawings for graphs of arbitrary degree, in particular Kn, with vertices drawn as boxes. It establishes asymptotic lower bounds for the volu...
Therese C. Biedl, Thomas C. Shermer, Sue Whiteside...
WEA
2005
Springer
107views Algorithms» more  WEA 2005»
15 years 10 months ago
Local Clustering of Large Graphs by Approximate Fiedler Vectors
Vectors [Extended Abstract] Pekka Orponen and Satu Elisa Schaeffer Laboratory for Theoretical Computer Science, P.O. Box 5400 FI-02015 TKK Helsinki University of Technology, Finlan...
Pekka Orponen, Satu Elisa Schaeffer
ER
2006
Springer
83views Database» more  ER 2006»
15 years 8 months ago
Time-Aggregated Graphs for Modeling Spatio-temporal Networks
regated Graphs for Modeling Spatio-Temporal Networks - An Extended Abstract Technical Report Department of Computer Science and Engineering University of Minnesota 4-192 EECS Build...
Betsy George, Shashi Shekhar
SAC
2006
ACM
15 years 10 months ago
Evaluating unstructured peer-to-peer lookup overlays
Unstructured peer-to-peer lookup systems incur small constant overhead per single join or leave operation, and can easily support keyword searches. Hence, they are suitable for dy...
Idit Keidar, Roie Melamed