Sciweavers

355 search results - page 41 / 71
» On Central Spanning Trees of a Graph
Sort
View
RSA
2010
118views more  RSA 2010»
14 years 8 months ago
Weight of a link in a shortest path tree and the Dedekind Eta function
The weight of a randomly chosen link in the shortest path tree on the complete graph with exponential i.i.d. link weights is studied. The corresponding exact probability generatin...
Piet Van Mieghem
APPROX
2009
Springer
153views Algorithms» more  APPROX 2009»
15 years 4 months ago
Average-Case Analyses of Vickrey Costs
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
Prasad Chebolu, Alan M. Frieze, Páll Melste...
HPCC
2007
Springer
15 years 4 months ago
An Adaptive Parallel Hierarchical Clustering Algorithm
Clustering of data has numerous applications and has been studied extensively. It is very important in Bioinformatics and data mining. Though many parallel algorithms have been des...
Zhaopeng Li, Kenli Li, Degui Xiao, Lei Yang
STACS
2007
Springer
15 years 4 months ago
Light Orthogonal Networks with Constant Geometric Dilation
An orthogonal spanner network for a given set of n points in the plane is a plane straight line graph with axis-aligned edges that connects all input points. We show that for any ...
Adrian Dumitrescu, Csaba D. Tóth
PODC
1990
ACM
15 years 1 months ago
Self-Stabilization of Dynamic Systems Assuming only Read/Write Atomicity
Three self-stabilizing protocols for distributed systems in the shared memory model are presented. The first protocol is a mutual exclusion protocol for tree structured systems. T...
Shlomi Dolev, Amos Israeli, Shlomo Moran