Sign in
Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering.
Fedor V. Fomin
Daniel Lokshtanov
Dániel Marx
Marcin Pilipczuk
Michal Pilipczuk
Saket Saurabh
Published in:
SIAM J. Comput. (2022)
Keyphrases
</>
space complexity
upper bound
graph theory
computational cost
learning algorithm
computationally efficient
theoretical analysis
data structure
evolutionary algorithm
directed graph
graph partitioning
polynomial time complexity