The complexity of pebbling reachability and solvability in planar and outerplanar graphs.
Timothy LewisCharles A. CusackLisa DionPublished in: Discret. Appl. Math. (2014)
Keyphrases
- planar graphs
- graph mining
- graph databases
- graph patterns
- graph isomorphism
- frequent subgraphs
- subgraph mining
- structured data
- pattern mining
- graph data
- computational complexity
- subgraph isomorphism
- weighted graph
- state space
- graph theoretic
- graph search
- undirected graph
- minimum weight
- decision problems
- social networks