Sciweavers

598 search results - page 74 / 120
» A random graph model for massive graphs
Sort
View
CORR
2006
Springer
102views Education» more  CORR 2006»
14 years 12 months ago
Structural Inference of Hierarchies in Networks
One property of networks that has received comparatively little attention is hierarchy, i.e., the property of having vertices that cluster together in groups, which then join to f...
Aaron Clauset, Cristopher Moore, M. E. J. Newman
PODC
2004
ACM
15 years 5 months ago
Analyzing Kleinberg's (and other) small-world Models
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
Charles U. Martel, Van Nguyen
ICS
2010
Tsinghua U.
15 years 9 months ago
Local Algorithms for Finding Interesting Individuals in Large Networks
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
Mickey Brautbar, Michael Kearns
KBSE
2005
IEEE
15 years 5 months ago
A context-sensitive structural heuristic for guided search model checking
Software verification using model checking often translates programs into corresponding transition systems that model the program behavior. As software systems continue to grow i...
Neha Rungta, Eric G. Mercer
MSWIM
2005
ACM
15 years 5 months ago
Topology control with better radio models: implications for energy and multi-hop interference
Topology Control (TC) is a well-studied technique used in wireless ad hoc networks to find energy-efficient and/or low-interference subgraphs of the maxpower communication graph....
Douglas M. Blough, Mauro Leoncini, Giovanni Resta,...