Recognition Complexity of Subgraphs of 2- and 3-Connected Planar Cubic Graphs.
Miriam GoetzePaul JungeblutTorsten UeckerdtPublished in: CoRR (2024)
Keyphrases
- graph mining
- graph databases
- recognition rate
- recognition accuracy
- graph structures
- maximum common subgraph
- subgraph isomorphism
- connected subgraphs
- object recognition
- labeled graphs
- graph theoretic
- pattern recognition
- computational complexity
- recognition process
- subgraph matching
- subgraph mining
- frequent subgraph mining
- graph properties
- worst case
- reachability queries
- connected components
- recognition algorithm
- character recognition
- polynomial time complexity
- np complete
- b spline
- graph patterns
- connected graphs
- spanning tree