The planar directed k -Vertex-Disjoint Paths problem is fixed-parameter tractable
Cygan, M and Marx, Dániel and Pilipczuk, M and Pilipczuk, M (2013) The planar directed k -Vertex-Disjoint Paths problem is fixed-parameter tractable. In: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS), 2013-10-26 - 2013-10-29, Berkeley, Amerikai Egyesült Államok.
![[img]](https://eprints.sztaki.hu/style/images/fileicons/text.png) |
Text
Cygan_197_2477506_z.pdf Restricted to Registered users only Download (584kB) |
| Item Type: | Conference or Workshop Item (-) |
|---|---|
| Subjects: | Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |
| Depositing User: | EPrints Admin |
| Date Deposited: | 05 Feb 2014 12:32 |
| Last Modified: | 05 Feb 2014 15:46 |
| URI: | https://eprints.sztaki.hu/id/eprint/7641 |
 |
Update Item |
