-free Graphs in Quasi-polynomial Time.
Akanksha AgrawalPaloma T. LimaDaniel LokshtanovSaket SaurabhRoohani SharmaPublished in: SODA (2024)
Keyphrases
- graph isomorphism
- bounded treewidth
- graph matching
- polynomial time complexity
- special case
- approximation algorithms
- computational complexity
- graph theoretic
- planar graphs
- structured objects
- worst case
- directed graph
- series parallel
- boolean functions
- complex structures
- random graphs
- graph construction
- np hardness
- subgraph isomorphism
- real time