Sciweavers

2365 search results - page 72 / 473
» All things are connected
Sort
View
CORR
2008
Springer
66views Education» more  CORR 2008»
15 years 1 months ago
On stars and Steiner stars. II
A Steiner star for a set P of n points in Rd connects an arbitrary center point to all points of P, while a star connects a point p P to the remaining n-1 points of P. All connec...
Adrian Dumitrescu, Csaba D. Tóth, Guangwu X...
KDD
2008
ACM
142views Data Mining» more  KDD 2008»
16 years 1 months ago
Weighted graphs and disconnected components: patterns and a generator
The vast majority of earlier work has focused on graphs which are both connected (typically by ignoring all but the giant connected component), and unweighted. Here we study numer...
Mary McGlohon, Leman Akoglu, Christos Faloutsos
ISAAC
2005
Springer
123views Algorithms» more  ISAAC 2005»
15 years 7 months ago
Sampling Unlabeled Biconnected Planar Graphs
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
SNPD
2008
15 years 2 months ago
Aggregate Congestion Control for Peer-to-Peer File Sharing Applications
Peer-to-Peer file sharing applications, which enable peers to establish multiple TCP connections between other peers to transfer data, pose new challenge to congestion control. Si...
Wei Li, Shanzhi Chen, Yaning Liu, Xin Li
SIAMJO
2008
144views more  SIAMJO 2008»
15 years 1 months ago
Embedded in the Shadow of the Separator
Eigenvectors to the second smallest eigenvalue of the Laplace matrix of a graph, also known as Fiedler vectors, are the basic ingredient in spectral graph partitioning heuristics....
Frank Göring, Christoph Helmberg, Markus Wapp...