209 search results - page 12 / 42 » Computing a Diameter-Constrained Minimum Spanning Tree in Pa... |
INFOVIS
2003
IEEE
15 years 2 months ago
2003
IEEE
Network evolution is a ubiquitous phenomenon in a wide variety of complex systems. There is an increasing interest in statistically modeling the evolution of complex networks such...
IPPS
2007
IEEE
15 years 3 months ago
2007
IEEE
Due to fundamental physical limitations and power constraints, we are witnessing a radical change in commodity microprocessor architectures to multicore designs. Continued perform...
80
Voted
ICALP
2009
Springer
15 years 9 months ago
2009
Springer
We present new results on Cartesian trees with applications in range minimum queries and bottleneck edge queries. We introduce a cache-oblivious Cartesian tree for solving the ran...
ISAAC
1997
Springer
15 years 1 months ago
1997
Springer
We present a randomized EREW PRAM algorithm to nd a minimum spanning forest in a weighted undirected graph. On an n-vertex graph the algorithm runs in o((logn)1+ ) expected time f...
APPROX
2004
Springer
15 years 2 months ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...