355 search results - page 33 / 71 » On Central Spanning Trees of a Graph |
108
Voted
CSR
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We survey classical and selected recent work on the reachability problem over finitely presented infinite graphs. The problem has a history of 100 years, and it is centra...
106
Voted
IPPS
2010
IEEE
14 years 10 months ago
2010
IEEE
In this paper, we study parallel I/O efficient graph algorithms in the Parallel External Memory (PEM) model, one of the private-cache chip multiprocessor (CMP) models. We study the...
88
Voted
JCO
2010
14 years 11 months ago
2010
Given a network G = (V, E), we say that a subset of vertices S ⊆ V has radius r if it is spanned by a tree of depth at most r. We are interested in determining whether G has a cu...
97
Voted
PR
2007
15 years 5 days ago
2007
In this paper we address the problem of how to learn a structural prototype that can be used to represent the variations present in a set of trees. The prototype serves as a patte...
95
Voted
ICIP
2008
IEEE
15 years 7 months ago
2008
IEEE
In this paper, we propose a new fast semi-supervised image segmentation method based on augmented tree partitioning. Unlike many existing methods that use a graph structure to mod...