1545 search results - page 198 / 309 » On tree congestion of graphs |
CORR
2010
Springer
14 years 10 months ago
2010
Springer
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
102
click to vote
ICCAD
2007
IEEE
15 years 7 months ago
2007
IEEE
Global routing is an important step in the physical design process. In this paper, we propose a new global routing algorithm Archer, which resolves some of the most common problem...
COCOA
2009
Springer
15 years 2 months ago
2009
Springer
: Under water sensor network is an important research direction in computer science. There are many interesting optimization problems regarding its design, routing and applications...
PODC
2005
ACM
15 years 3 months 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...
SIGECOM
2009
ACM
15 years 4 months ago
2009
ACM
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...