On Non-Intersecting Eulerian Circuits
| dc.contributor.author | Bent, Samuel W | en_US |
| dc.contributor.author | Manber, Udi | en_US |
| dc.date.accessioned | 2012-03-15T16:37:49Z | |
| dc.date.available | 2012-03-15T16:37:49Z | |
| dc.date.created | 1984 | en_US |
| dc.date.issued | 1984 | |
| dc.identifier.citation | TR546 | |
| dc.identifier.uri | http://digital.library.wisc.edu/1793/58530 | |
| dc.description.abstract | The 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-complete | en_US |
| dc.format.mimetype | application/pdf | en_US |
| dc.publisher | University of Wisconsin-Madison Department of Computer Sciences | en_US |
| dc.title | On Non-Intersecting Eulerian Circuits | en_US |
| dc.type | Technical Report | en_US |
Files in this item
This item appears in the following Collection(s)
-
CS Technical Reports
Technical Reports Archive for the Department of Computer Sciences at the University of Wisconsin-Madison