3 search results - page 1 / 1 » Linear time construction of 5-phylogenetic roots for tree ch... |
JCO
2010
13 years 5 months ago
2010
ALGORITHMICA
2007
13 years 7 months ago
2007
A tree t-spanner T in a graph G is a spanning tree of G such that the distance between every pair of vertices in T is at most t times their distance in G. The tree t-spanner proble...
COCOA
2008
Springer
13 years 9 months ago
2008
Springer
In a finite simple undirected graph, a vertex is simplicial if its neighborhood is a clique. We say that, for k 2, a graph G = (VG, EG) is the k-simplicial power of a graph H = (V...