1545 search results - page 231 / 309 » On tree congestion of graphs |
154
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
We consider the following model for fire containment. We are given an undirected graph G = (V, E) with a source vertex s where the fire starts. At each time step, the firefighters...
165
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract—Wireless mesh networks are popular as a costeffective means to provide broadband connectivity to large user populations. A mesh network placement provides coverage, such...
182
click to vote
FSTTCS
2009
Springer
16 years 26 days ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
181
click to vote
IWPEC
2009
Springer
16 years 25 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...
174
click to vote
STOC
1996
ACM
15 years 10 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...