An exact characterization of tractable demand patterns for maximum disjoint path problems

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. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, pp. 642-661. ISBN 978-1-61197-374-7 10.1137/1.9781611973730.44

[img]
Preview
Text
Marx_642_2983452_ny.pdf

Download (494kB) | Preview
[img] Text
Marx_642_2983452_z.pdf
Restricted to Registered users only

Download (523kB) | Request a copy
Item Type: Book Section
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: 05 Feb 2016 18:29
Last Modified: 05 Feb 2016 18:29
URI: http://eprints.sztaki.hu/id/eprint/8577

Update Item Update Item