356 search results - page 23 / 72 » A Most General Edge Elimination Polynomial - Thickening of E... |
108
click to vote
SIROCCO
2004
15 years 1 months ago
2004
Abstract. We study asynchronous packet radio networks in which transmissions among nodes may be delayed. We consider the task of broadcasting a message generated by the source node...
WADS
2007
Springer
15 years 6 months ago
2007
Springer
Let G = (S, E) be a plane straight-line graph on a finite point set S ⊂ R2 in general position. The incident angles of a point p ∈ S in G are the angles between any two edges ...
122
click to vote
TCS
2010
14 years 10 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
ISAAC
2005
Springer
15 years 5 months ago
2005
Springer
Let G = (V, E) be an undirected graph, and let B ⊆ V × V be a collection of vertex pairs. We give an incremental polynomial time algorithm to enumerate all minimal edge sets X ...
86
Voted
ISMB
2001
15 years 1 months ago
2001
Abstract: Absolute fast converging phylogenetic reconstruction methods are provably guaranteed to recover the true tree with high probability from sequences that grow only polynomi...