2877 search results - page 37 / 576 » The Complexity of Planarity Testing |
IWPEC
2009
Springer
14 years 3 months ago
2009
Springer
An induced matching in graph G is a matching which is an induced subgraph of G. Clearly, among two vertices with the same neighborhood (called twins) at most one is matched in any...
APPML
2007
13 years 9 months ago
2007
It is shown that every planar graph with no separating triangles is a subgraph of a Hamiltonian planar graph; that is, Whitney’s theorem holds without the assumption of a triang...
COCOON
2005
Springer
14 years 2 months ago
2005
Springer
We consider the problem of finding a balanced ordering of the vertices of a graph. More precisely, we want to minimise the sum, taken over all vertices v, of the difference betwe...
ICDAR
2003
IEEE
14 years 2 months ago
2003
IEEE
A skew angle estimation approach based on the application of a fuzzy directional runlength is proposed for complex address images. The proposed technique was tested on a variety o...
ICIP
2005
IEEE
14 years 10 months ago
2005
IEEE
Robustness and accuracy are major issues in real-time tracking. This paper describes a reliable tracking for markerless planar objects based on the fusion of visual cues and on th...