3396 search results - page 188 / 680 » Tree representations of graphs |
IWOCA
2009
Springer
14 years 3 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 ...
CG
2008
Springer
13 years 11 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...
CVGIP
2004
13 years 9 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...
IJCM
2002
13 years 9 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...
ICCV
2003
IEEE
14 years 11 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...