On the Complexity of Planar Covering of Small Graphs.

Ondrej Bílka Jozef Jirásek Pavel Klavík Martin Tancer Jan Volec

Published in: WG (2011)

Keyphrases

graph matching
database
small number
space complexity
computational complexity
directed graph
polynomial time complexity
image sequences
pattern recognition
computational cost
decision problems
graph partitioning
series parallel