-Free Graphs in Polynomial Time.

Andreas Brandstädt Raffaele Mosca

Published in: CoRR (2019)

Keyphrases

bounded treewidth
graph isomorphism
polynomial time complexity
special case
approximation algorithms
neural network
np complete
directed graph
planar graphs
weighted graph
graph theory
graph mining
random graphs
data sets
series parallel
graph matching
pairwise
lower bound
bounded degree