Browse by Person
Up a level |
Jump to: 2000
Number of items: 1.
2000
Nedev, Z.P. and Wood, Peter (2000) A polynomial-time algorithm for finding regular simple paths in outerplanar graphs. Journal of Algorithms 35 (2), pp. 235-259. ISSN 0196-6774.
Up a level |
Nedev, Z.P. and Wood, Peter (2000) A polynomial-time algorithm for finding regular simple paths in outerplanar graphs. Journal of Algorithms 35 (2), pp. 235-259. ISSN 0196-6774.