Polar permutation graphs are polynomial-time recognisable.
Tínaz EkimPinar HeggernesDaniel MeisterPublished in: Eur. J. Comb. (2013)
Keyphrases
- graph isomorphism
- special case
- bounded treewidth
- worst case
- planar graphs
- graph theoretic
- connected graphs
- polar coordinates
- approximation algorithms
- graph structure
- graph representation
- graph partitioning
- series parallel
- graph mining
- rotation invariant
- graph matching
- directed graph
- doubly stochastic
- subgraph isomorphism
- graph structures
- graph model
- fourier transform
- computational complexity
- graph construction
- graph clustering
- bounded degree
- pattern recognition
- learning algorithm