Sciweavers

3396 search results - page 85 / 680
» Tree representations of graphs
Sort
View
118
Voted
ISAAC
2010
Springer
270views Algorithms» more  ISAAC 2010»
14 years 10 months ago
Generating Trees on Multisets
Given a multiset M = V1 V2
Bingbing Zhuang, Hiroshi Nagamochi
106
Voted
IPPS
2010
IEEE
14 years 10 months ago
Parallel external memory graph algorithms
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...
Lars Arge, Michael T. Goodrich, Nodari Sitchinava
122
Voted
AAAI
2007
15 years 3 months ago
Macroscopic Models of Clique Tree Growth for Bayesian Networks
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 ...
Ole J. Mengshoel
IPCV
2008
15 years 2 months ago
Hierarchical Minimum Spanning Trees for Lossy Image Set Compression
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 ...
Anthony Schmieder, Howard Cheng, Barry Gergel, Xia...
SODA
2007
ACM
106views Algorithms» more  SODA 2007»
15 years 2 months ago
Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion
This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a ...
Ittai Abraham, Yair Bartal, Ofer Neiman