Fast Parallel Algorithms for the Subgraph Homophormism and the Subgraph Isomorphism Problem for Classes of Planat Graphs.
Andrzej LingasAndrzej ProskurowskiPublished in: FSTTCS (1987)
Keyphrases
- subgraph isomorphism
- parallel algorithm
- graph matching
- graph databases
- subgraph mining
- maximum common subgraph
- graph isomorphism
- subgraph matching
- edit distance
- graph mining
- parallel computation
- search tree
- weighted graph
- shared memory
- labeled graphs
- query graph
- graph data
- frequent subgraphs
- pattern recognition
- depth first search
- graph patterns
- search algorithm
- hard problems
- orders of magnitude