Regular Intersection Emptiness of Graph Problems: Finding a Needle in a Haystack of Graphs with the Help of Automata.
Petra WolfHenning FernauPublished in: CoRR (2020)
Keyphrases
- graph theory
- graph representation
- maximum independent set
- graph structure
- graph theoretic
- polynomial time complexity
- weighted graph
- graph partitioning
- random walk
- maximum clique
- series parallel
- directed graph
- np complete
- graph clustering
- relational structures
- graph structures
- subgraph isomorphism
- graph matching
- graph isomorphism
- strongly connected
- finding the shortest path
- massive graphs
- structural pattern recognition
- structured data
- graph properties
- graph classification
- graph databases
- planar graphs
- graph construction
- minimum spanning tree
- bipartite graph