2877 search results - page 41 / 576 » The Complexity of Planarity Testing |
CORR
2006
Springer
13 years 9 months ago
2006
Springer
We prove that the max-cut and max-bisection problems are NP-hard on unit disk graphs. We also show that -precision graphs are planar for > 1/ 2 and give a dichotomy theorem f...
DIAL
2004
IEEE
14 years 22 days ago
2004
IEEE
A new text line location and separation algorithm for complex handwritten documents is proposed. The algorithm is based on the application of a fuzzy directional runlength. The pr...
JAIR
2008
13 years 9 months ago
2008
We investigate the computational complexity of testing dominance and consistency in CP-nets. Up until now, the complexity of dominance has been determined only for restricted clas...
ICONIP
2010
13 years 7 months ago
2010
Cortical activity exhibits complex, persistent self-sustained dynamics, which is hypothesised to support the brain’s sophisticated processing capabilities. Prior studies have sho...
ICPR
2006
IEEE
14 years 10 months ago
2006
IEEE
A new method is presented for detecting planar rotational symmetry under affine projection. The method can deal with partial occlusion and is able to detect multiple rotationally ...