Sciweavers

2079 search results - page 74 / 416
» Universality of random graphs
Sort
View
CSR
2007
Springer
15 years 10 months ago
Maximal Intersection Queries in Randomized Graph Models
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
Benjamin Hoffmann, Yury Lifshits, Dirk Nowotka
GECCO
2007
Springer
169views Optimization» more  GECCO 2007»
15 years 10 months ago
Hybrid evolutionary algorithms on minimum vertex cover for random graphs
Martin Pelikan, Rajiv Kalapala, Alexander K. Hartm...
MFCS
2007
Springer
15 years 10 months ago
Expander Properties and the Cover Time of Random Intersection Graphs
Sotiris E. Nikoletseas, Christoforos Raptopoulos, ...
WAW
2007
Springer
105views Algorithms» more  WAW 2007»
15 years 10 months ago
Deterministic Decentralized Search in Random Graphs
Esteban Arcaute, Ning Chen, Ravi Kumar, David Libe...
ICALP
2005
Springer
15 years 9 months ago
On the Cover Time of Random Geometric Graphs
Chen Avin, Gunes Ercal