Sciweavers

5606 search results - page 86 / 1122

» Randomization Techniques for Graphs.

129

ICALP
2005
Springer

116views Programming Languages» more ICALP 2005»

On the Cover Time of Random Geometric Graphs

16 years 4 days ago

On the Cover Time of Random Geometric Graphs

Download www.bgu.ac.il

Chen Avin, Gunes Ercal

claim paper

Read More »

172

WSTST
2005
Springer

217views Applied Computing» more WSTST 2005»

Analysis of Connectedness of the Fixed Radius Random Graph Model in One-dimensional Space

16 years 3 days ago

Analysis of Connectedness of the Fixed Radius Random Graph Model in One-dimensional Space

Download kussharo.complex.eng.hokudai.ac.jp

Ai Noshiro, Takeshi Yoshikawa, Masahito Kurihara

claim paper

Read More »

154

EDBTW
2004
Springer

116views Software Engineering» more EDBTW 2004»

A Scalable Randomized Method to Compute Link-Based Similarity Rank on the Web Graph

16 years 19 hour ago

A Scalable Randomized Method to Compute Link-Based Similarity Rank on the Web Graph

Download www.ilab.sztaki.hu

Dániel Fogaras, Balázs Rácz

claim paper

Read More »

125

COMPGEOM
2010
ACM

159views Discrete Geometry» more COMPGEOM 2010»

A randomized O(m log m) time algorithm for computing Reeb graphs of arbitrary simplicial complexes

15 years 11 months ago

A randomized O(m log m) time algorithm for computing Reeb graphs of arbitrary simplicial complexes

Download www.cse.ohio-state.edu

William Harvey, Yusu Wang, Rephael Wenger

claim paper

Read More »

141

COCO
2001
Springer

101views Algorithms» more COCO 2001»

Resolution Complexity of Independent Sets in Random Graphs

15 years 11 months ago

Resolution Complexity of Independent Sets in Random Graphs

Download www.cs.cornell.edu

Paul Beame, Russell Impagliazzo, Ashish Sabharwal

claim paper

Read More »

« Prev « First page 86 / 1122 Last » Next »