3396 search results - page 188 / 680 » Tree representations of graphs |
107
click to vote
IWOCA
2009
Springer
15 years 9 months ago
2009
Springer
The notion of submodular partition functions generalizes many of well-known tree decompositions of graphs. For fixed k, there are polynomial-time algorithms to determine whether ...
129
click to vote
CG
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its t...
115
click to vote
CVGIP
2004
15 years 2 months ago
2004
Topological volume skeletonization is a novel approach for automating transfer function design in visualization by extracting the topological structure of a volume dataset. The sk...
133
click to vote
IJCM
2002
15 years 2 months ago
2002
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...
134
click to vote
ICCV
2003
IEEE
16 years 4 months ago
2003
IEEE
Within this paper a new framework for Bayesian tracking is presented, which approximates the posterior distribution at multiple resolutions. We propose a tree-based representation...