A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system.
Peter EadesSeok-Hee HongNaoki KatohGiuseppe LiottaPascal SchweitzerYusuke SuzukiPublished in: Theor. Comput. Sci. (2013)
Keyphrases
- independent set
- line drawings
- structured objects
- graph clustering
- test cases
- data mining
- series parallel
- graph kernels
- graph theoretic
- rotation invariant
- directed graph
- graph theory
- image registration
- graph representation
- viewpoint
- object recognition
- pattern recognition
- graph construction
- subgraph isomorphism
- image segmentation
- genetic algorithm
- database