First Page | Document Content | |
---|---|---|
Date: 2008-10-29 00:08:28Polyhedron Octahedron Eulerian path Induced path Matching Route inspection problem Line graph Edge coloring Graph theory Planar graphs NP-complete problems | Computational Balloon Twisting: The Theory of Balloon Polyhedra Erik D. Demaine∗ Martin L. Demaine∗Add to Reading ListSource URL: cccg.caDownload Document from Source WebsiteFile Size: 2,69 MBShare Document on Facebook |