Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs.
Mauro MezziniPublished in: Theor. Comput. Sci. (2018)
Keyphrases
- graph isomorphism
- polynomial time complexity
- computational complexity
- worst case
- np complete
- minimum cost
- np hard
- spanning tree
- probabilistic model
- graph mining
- graph databases
- undirected graph
- minimum spanning tree
- graph patterns
- subgraph isomorphism
- randomized algorithm
- planar graphs
- optimal solution
- matching algorithm
- clustering method
- query processing