Shortest Enclosing Walks and Cycles in Embedded Graphs

J. Scott Provan. Shortest Enclosing Walks and Cycles in Embedded Graphs. Inf. Process. Lett., 30(3):119-125, 1989.

Authors

J. Scott Provan

This author has not been identified. Look up 'J. Scott Provan' in Google