A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph.
Joseph Douglas HortonPublished in: SIAM J. Comput. (1987)
Keyphrases
- cost function
- learning algorithm
- matching algorithm
- detection algorithm
- preprocessing
- graph isomorphism
- np hard
- graph structure
- computational complexity
- causal graph
- expectation maximization
- worst case
- dynamic programming
- objective function
- probabilistic model
- segmentation algorithm
- search space
- clustering method
- polynomial time complexity
- graph databases
- planar graphs
- maximum flow
- shortest common supersequence
- minimum spanning tree
- spanning tree
- tree structure
- special case
- k means
- optimal solution
- similarity measure