Login / Signup
-Free Graphs in Polynomial Time.
Andreas Brandstädt
Raffaele Mosca
Published in:
CoRR (2019)
Keyphrases
</>
graph isomorphism
polynomial time complexity
bounded treewidth
special case
computational complexity
np complete
graph matching
graph theoretic
weighted graph
graph mining
worst case
planar graphs
graph search
subgraph isomorphism
series parallel
object recognition
pattern recognition