Computing the forcing spectrum of outerplanar graphs in polynomial time.
Maximilian GorskyFabian KreßinPublished in: CoRR (2024)
Keyphrases
- graph isomorphism
- planar graphs
- graph mining
- graph databases
- graph patterns
- subgraph mining
- graph search
- subgraph isomorphism
- frequent subgraphs
- graph data
- conp complete
- pattern mining
- graph theoretic
- undirected graph
- spanning tree
- connected components
- data exchange
- database
- graph structures
- community detection
- approximation algorithms