Marx, Dániel and Wollan, P. (2015) An exact characterization of tractable demand patterns for maximum disjoint path problems. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms. ACM Press, New York, pp. 642-661. ISBN 978-1-61197-374-7
|
Text
marx_wollan_soda2015_paths_u.pdf Download (494kB) | Preview |
| Item Type: | Book Section |
|---|---|
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika > QA74 Analysis / analízis Q Science / természettudomány > QA Mathematics / matematika > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 19 Dec 2015 06:51 |
| Last Modified: | 19 Dec 2015 06:51 |
| URI: | http://real.mtak.hu/id/eprint/31191 |
Actions (login required)
 |
Edit Item |
