Recognizing Hyperelliptic Graphs in Polynomial Time.
Jelco M. BodewesHans L. BodlaenderGunther CornelissenMarieke van der WegenPublished in: WG (2018)
Keyphrases
- graph isomorphism
- special case
- planar graphs
- polynomial time complexity
- bounded treewidth
- graph theoretic
- worst case
- series parallel
- graph theory
- graph clustering
- graph representation
- graph structures
- automatic recognition
- weighted graph
- graph matching
- directed graph
- neural network
- spanning tree
- graph mining
- graph kernels
- finite automata
- approximation algorithms
- upper bound
- structured objects
- computational complexity
- genetic algorithm