Bacsó, Gábor and Lokshtanov, Daniel and Marx, Dániel and Pilipczuk, Marcin and Tuza, Zsolt (2018) Subexponential-Time Algorithms for Maximum Independent Set in Pt-Free and Broom-Free Graphs. ALGORITHMICA. pp. 1-18. ISSN 0178-4617
|
Text
1804.04077v1.pdf Download (893kB) | Preview |
Official URL: https://doi.org/10.1007/s00453-018-0479-5
| Item Type: | Article |
|---|---|
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika > QA166-QA166.245 Graphs theory / gráfelmélet |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 17 Jan 2019 08:53 |
| Last Modified: | 17 Jan 2019 08:53 |
| URI: | http://real.mtak.hu/id/eprint/90072 |
Actions (login required)
 |
Edit Item |
