16 search results - page 3 / 4 » On Graph Thickness, Geometric Thickness, and Separator Theor... |
ICPR
2002
IEEE
15 years 10 months ago
2002
IEEE
A heretofore unsolved problem of great archaeological importance is the automatic assembly of pots made on a wheel from the hundreds (or thousands) of sherds found at an excavatio...
CORR
2004
Springer
14 years 9 months ago
2004
Springer
A (k, t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order of each vertex colour class, and a (non-proper) edge k-colouring such that between...
STOC
2004
ACM
15 years 10 months ago
2004
ACM
We give a O( log n)-approximation algorithm for sparsest cut, edge expansion, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leig...
106
click to vote
COMGEO
2006
ACM
14 years 9 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
171
click to vote
VCBM
2010
14 years 4 months ago
2010
We present the latest developments in modeling 3D biomedical data via the Medial Scaffold (MS), a 3D acyclic oriented graph representation of the Medial Axis (MA) [LK07, SP08]. Th...