Matthew Andrews, Lisa Zhang. Hardness of the undirected edge-disjoint paths problem. In Harold N. Gabow, Ronald Fagin, editors, Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005. pages 276-283, ACM, 2005. [doi]
No references recorded for this publication.
No citations of this publication recorded.