137 search results - page 12 / 28 » Locally connected spanning trees on graphs |
191
click to vote
FOCS
2008
IEEE
16 years 13 days 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...
171
click to vote
AINA
2007
IEEE
16 years 10 days ago
2007
IEEE
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
162
click to vote
SIGCOMM
2000
ACM
15 years 10 months ago
2000
ACM
As the number of hosts attached to a network increases beyond what can be connected by a single local area network (LAN), forwarding packets between hosts on different LANs become...
177
click to vote
IWPEC
2009
Springer
16 years 16 days ago
2009
Springer
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
145
click to vote
JCO
2010
15 years 4 months ago
2010
Given a network G = (V, E), we say that a subset of vertices S ⊆ V has radius r if it is spanned by a tree of depth at most r. We are interested in determining whether G has a cu...