271 search results - page 12 / 55 » Quasi-isometries between graphs and trees |
FOCS
2009
IEEE
15 years 5 months ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
WG
2004
Springer
15 years 4 months ago
2004
Springer
The Phylogenetic kth Root Problem (PRk) is the problem of finding a (phylogenetic) tree T from a given graph G = (V, E) such that (1) T has no degree-2 internal nodes, (2) the ex...
84
Voted
WG
1997
Springer
15 years 3 months ago
1997
Springer
In this paper we present a parallel algorithm that decides whether a graph G has treewidth at most two, and if so, construct a tree decomposition or path decomposition of minimum ...
109
click to vote
GAMESEC
2010
14 years 9 months ago
2010
We study the strategic interaction between a network manager whose goal is to choose (as communication infrastructure) a spanning tree of a network given as an undirected graph, an...
WWW
2001
ACM
15 years 11 months ago
2001
ACM
Many emerging web and Internet applications are based on a group communications model. Thus, securing group communications is an important Internet design issue. The key graph app...