2487 search results - page 108 / 498 » Partitions of Graphs into Trees |
141
Voted
ISAAC
2010
Springer
15 years 1 months ago
2010
Springer
Given a multiset M = V1 V2
137
Voted
IPPS
2010
IEEE
15 years 1 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...
112
Voted
COMBINATORICS
2000
15 years 3 months ago
2000
The set R of relevant cycles of a graph G is the union of its minimum cycle bases. We introduce a partition of R such that each cycle in a class W can be expressed as a sum of oth...
143
click to vote
AAAI
2007
15 years 5 months ago
2007
In clique tree clustering, inference consists of propagation in a clique tree compiled from a Bayesian network. In this paper, we develop an analytical approach to characterizing ...
171
Voted
IPCV
2008
15 years 4 months ago
2008
Minimum spanning tree algorithms have been proposed for the lossy compression of image sets. In these algorithms, a complete graph is constructed from the entire image set and an ...