Sciweavers

865 search results - page 80 / 173
» Random graph models for the web graph
Sort
View
CSB
2005
IEEE
103views Bioinformatics» more  CSB 2005»
15 years 12 months ago
ECOME: A simple model for an evolving consumption web
ECOME is an interactive, graph-based model for simulating an evolving, closed consumption web. It demonstrates the fundamental behavior of a global ecosystem over evolutionary tim...
Christopher Bystroff, Sam DeLuca, Carl N. McDaniel
CPC
2002
95views more  CPC 2002»
15 years 6 months ago
Permutation Pseudographs And Contiguity
The space of permutation pseudographs is a probabilistic model of 2-regular pseudographs on n vertices, where a pseudograph is produced by choosing a permutation of {1, 2, . . . ...
Catherine S. Greenhill, Svante Janson, Jeong Han K...
INFOCOM
2008
IEEE
16 years 21 days ago
Reducing Maximum Stretch in Compact Routing
—It is important in communication networks to use routes that are as short as possible (i.e have low stretch) while keeping routing tables small. Recent advances in compact routi...
Mihaela Enachescu, Mei Wang, Ashish Goel
CIAC
2006
Springer
97views Algorithms» more  CIAC 2006»
15 years 10 months ago
Network Discovery and Verification with Distance Queries
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
Thomas Erlebach, Alexander Hall, Michael Hoffmann ...
IJAC
2008
97views more  IJAC 2008»
15 years 6 months ago
Random Generation of Finitely Generated Subgroups of a Free Group
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertic...
Frédérique Bassino, Cyril Nicaud, Pa...