106 search results - page 15 / 22 » An Exact Algorithm for the Maximum Leaf Spanning Tree Proble... |
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
IPPS
2007
IEEE
14 years 1 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...
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
We investigate the problem of maintaining a topology with small degree as well as small diameter in a dynamic distributed system such that the system always stays connected and pr...
INFOCOM
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract—Latency reduction in distributed interactive applications has been studied intensively. Such applications may have stringent latency requirements and dynamic user groups...
PODC
2005
ACM
14 years 19 days ago
2005
ACM
The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check...