Login / Signup
On Parallel Complexity of the Subgraph Homeomorphism and the Subgraph Isomorphism Problem for Classes of Planar Graphs.
Andrzej Lingas
Andrzej Proskurowski
Published in:
Theor. Comput. Sci. (1989)
Keyphrases
</>
subgraph isomorphism
planar graphs
graph matching
weighted graph
graph databases
depth first search
search tree
edit distance
graph mining
hard problems
graph data
worst case
greedy algorithm
object recognition
random walk
graph patterns
dynamic programming