2487 search results - page 328 / 498 » Partitions of Graphs into Trees |
124
Voted
CORR
2010
Springer
15 years 3 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...
139
click to vote
PLDI
2006
ACM
15 years 9 months ago
2006
ACM
Static analysis of programs in weakly typed languages such as C and C++ is generally not sound because of possible memory errors due to dangling pointer references, uninitialized ...
119
Voted
BMCBI
2007
15 years 3 months ago
2007
Background: Identification of the structural domains of proteins is important for our understanding of the organizational principles and mechanisms of protein folding, and for ins...
138
Voted
COCOA
2009
Springer
15 years 8 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...
125
click to vote
PODC
2005
ACM
15 years 9 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...