BIROn - Birkbeck Institutional Research Online
    Up a level
    Export as [feed] Atom [feed] RSS
    Group by: Author(s) | Date | School | No Grouping
    Jump to: N
    Number of items: 1.

    N

    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.

    This list was generated on Tue Apr 23 04:25:07 2024 BST.