1172 search results - page 87 / 235 » Path Algorithms on Regular Graphs |
120
Voted
MICCAI
2009
Springer
15 years 5 months ago
2009
Springer
We propose a recursive Bayesian model for the delineation of coronary arteries from 3D CT angiograms (cardiac CTA) and discuss the use of discrete minimal path techniques as an eļ¬...
80
Voted
JGAA
2006
15 years 14 days ago
2006
In this paper we introduce a direct motivation for solving the minimum 2-sum problem, for which we present a linear-time algorithm inspired by the Algebraic Multigrid approach whi...
100
click to vote
APPROX
2006
Springer
15 years 4 months ago
2006
Springer
Consider the following problem: For given graphs G and F1, . . . , Fk, find a coloring of the edges of G with k colors such that G does not contain Fi in color i. For example, if e...
126
click to vote
ESA
2011
Springer
14 years 7 days ago
2011
Springer
Abstract. In this paper we address the problem of building a compressed self-index that, given a distribution for the pattern queries and a bound on the space occupancy, minimizes ...
110
Voted
CSR
2009
Springer
15 years 7 months ago
2009
Springer
The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespeciļ¬ed sets of vertices. We show that this problem is...