Fixed Parameter Algorithms for Minor-Closed Graphs (of Locally Bounded Treewidth)
Frick and Grohe showed that for each property phi that is definable in first-order logic, and for each class of minor-closed graphs of locally bounded treewidth, there is an O(n^(1+epsilon))-time algorithm deciding whether a given graph has property phi. In this paper, we extend this result for fixe...
| Main Authors: | , |
|---|---|
| Published: |
2023
|
| Online Access: | https://hdl.handle.net/1721.1/149990 |