Subexponential-Time Algorithms for Maximum Independent Set in Pt-Free and Broom-Free Graphs

Bacsó, Gábor and Lokshtanov, D and Marx, Dániel and Pilipczuk, M and Tuza, Zsolt (2018) Subexponential-Time Algorithms for Maximum Independent Set in Pt-Free and Broom-Free Graphs. ALGORITHMICA, xx (x). pp. 1-18. ISSN 0178-4617 10.1007/s00453-018-0479-5

[img] Text
Bacso_1_3424408_ny.pdf

Download (433kB)
Item Type: Article
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: 08 Jan 2019 16:24
Last Modified: 09 Jan 2019 15:50
URI: http://eprints.sztaki.hu/id/eprint/9562

Update Item Update Item