Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering
Fomin, FV and Lokshtanov, D and Marx, Dániel and Pilipczuk, M and Pilipczuk, M (2016) Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering. In: 57th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2016. IEEE Computer Society, New York, pp. 515-524. ISBN 9781509039333 10.1109/FOCS.2016.62
|
Text
Fomin_515_3174174_ny.pdf Download (412kB) | Preview |
Official URL: http://ieee-focs.org/FOCS-2016-Papers/3933a515.pdf
| Item Type: | Book Section |
|---|---|
| Uncontrolled Keywords: | Graph theory; Sub-exponential algorithms; planar graph; Parameterized algorithm; Free graphs; Dynamic programming techniques; Connected Subgraph; Classic techniques; Set theory; Polynomial approximation; Parameterization; Parameter estimation; Integer programming; Graphic methods; dynamic programming; Directed graphs; subgraph isomorphism; subexponential algorithms; Planar graphs; apex-minor-free graphs |
| Subjects: | Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |
| Divisions: | Informatics Laboratory |
| SWORD Depositor: | MTMT Injector |
| Depositing User: | MTMT Injector |
| Date Deposited: | 29 Jan 2017 20:37 |
| Last Modified: | 21 Jul 2019 14:03 |
| URI: | https://eprints.sztaki.hu/id/eprint/9045 |
 |
Update Item |
