A Polynomial-Time Algorithm for Subgraph Isomorphism of Two-Connected Series-Parallel Graphs.
Andrzej LingasMaciej M. SysloPublished in: ICALP (1988)
Keyphrases
- subgraph isomorphism
- graph isomorphism
- maximum common subgraph
- series parallel
- computational complexity
- graph matching
- np hard
- worst case
- optimal solution
- graph structure
- matching algorithm
- objective function
- simulated annealing
- dynamic programming
- weighted graph
- probabilistic model
- graph databases
- search space
- lower bound
- pattern recognition