Recognizing hyperelliptic graphs in polynomial time.
Jelco M. BodewesHans L. BodlaenderGunther CornelissenMarieke van der WegenPublished in: CoRR (2017)
Keyphrases
- graph isomorphism
- special case
- bounded treewidth
- graph matching
- graph theoretic
- polynomial time complexity
- computational complexity
- planar graphs
- graph representation
- approximation algorithms
- graph databases
- series parallel
- graph theory
- bounded degree
- random graphs
- structured objects
- learning algorithm
- complex structures
- undirected graph
- graph model
- bipartite graph
- data exchange
- np complete
- object recognition
- search algorithm