2487 search results - page 108 / 498 » Partitions of Graphs into Trees |
ISAAC
2010
Springer
13 years 7 months ago
2010
Springer
Given a multiset M = V1 V2
IPPS
2010
IEEE
13 years 7 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...
COMBINATORICS
2000
13 years 9 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...
AAAI
2007
14 years 6 hour 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 ...
IPCV
2008
13 years 11 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 ...