491 search results - page 82 / 99 » On cyclically orientable graphs |
CADE
2007
Springer
14 years 7 months ago
2007
Springer
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
SMI
2007
IEEE
14 years 1 months ago
2007
IEEE
In this paper, we propose a new algorithm for the fundamental problem of reconstructing surfaces from a large set of unorganized 3D data points. The local shapes of the surface ar...
FSTTCS
2007
Springer
14 years 1 months ago
2007
Springer
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...
APPROX
2005
Springer
14 years 27 days ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
ISBI
2011
IEEE
12 years 11 months ago
2011
IEEE
High angular resolution diffusion imaging (HARDI) allows in vivo analysis of the white matter structure and connectivity. Based on orientation distribution functions (ODFs) that r...