-Free Graphs in Quasi-Polynomial Time.

Peter Gartland Daniel Lokshtanov

Published in: CoRR (2020)

Keyphrases

graph isomorphism
polynomial time complexity
bounded treewidth
graph representation
planar graphs
special case
graph theory
worst case
np complete
spanning tree
graph theoretic
approximation algorithms
directed graph
weighted graph
graph clustering
graph structures
random walk