2877 search results - page 169 / 576 » The Complexity of Planarity Testing |
141
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
136
Voted
WADS
2009
Springer
15 years 11 months ago
2009
Springer
Locked tree linkages have been known to exist in the plane since 1998, but it is still open whether they have a polynomial-time characterization. This paper examines the properties...
136
click to vote
COMPGEOM
2009
ACM
15 years 11 months ago
2009
ACM
We describe the first algorithms to compute minimum cuts in surface-embedded graphs in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, w...
143
click to vote
SMI
2008
IEEE
15 years 11 months ago
2008
IEEE
Following the definition of developable surface in differential geometry, the flattenable mesh surface, a special type of piecewiselinear surface, inherits the good property of ...
111
click to vote
ICRA
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract—Automation has long been recognized as an important goal in AFM (Atomic Force Microscope) nanomanipulation research. For the precise manipulation of small particles with...