Recognizing hyperelliptic graphs in polynomial time.
Jelco M. BodewesHans L. BodlaenderGunther CornelissenMarieke van der WegenPublished in: Theor. Comput. Sci. (2020)
Keyphrases
- graph isomorphism
- polynomial time complexity
- special case
- bounded treewidth
- planar graphs
- graph matching
- graph construction
- computational complexity
- structured objects
- worst case
- np complete
- graph search
- graph data
- graph databases
- graph mining
- neural network
- approximation guarantees
- labeled graphs
- undirected graph
- automatic recognition
- graph partitioning
- database
- graph structure
- graph theory
- directed graph
- data sets