A Polynomial-Time Algorithm for Finding Regular Simple Paths in Outerplanar Graphs.

Zhivko Prodanov Nedev Peter T. Wood

Published in: J. Algorithms (2000)

Keyphrases

graph isomorphism
graph mining
computational complexity
worst case
matching algorithm
planar graphs
clustering method
np hard
association rule mining
tree structure
graph model
graph search
polynomial time complexity
subgraph mining