On Non-Intersecting Eulerian Circuits

Simple item page
dc.contributor.authorBent, Samuel Wen_US
dc.contributor.authorManber, Udien_US
dc.date.accessioned2012-03-15T16:37:49Z
dc.date.available2012-03-15T16:37:49Z
dc.date.created1984en_US
dc.date.issued1984
dc.description.abstractThe following question arises in flame-cutting and similar applications. "Given a graph drawn in the plane, is there an Eulerian circuit in which successive edges always belong to a common face?" We prove that this question and related ones are NP-completeen_US
dc.format.mimetypeapplication/pdfen_US
dc.identifier.citationTR546
dc.identifier.urihttp://digital.library.wisc.edu/1793/58530
dc.publisherUniversity of Wisconsin-Madison Department of Computer Sciencesen_US
dc.titleOn Non-Intersecting Eulerian Circuitsen_US
dc.typeTechnical Reporten_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR546.pdf
Size:
1.34 MB
Format:
Adobe Portable Document Format
Download

Collections

CS Technical Reports