论文信息 - Computational Balloon Twisting: The Theory of Balloon Polyhedra - 字舞流文

Computational Balloon Twisting: The Theory of Balloon Polyhedra

This paper builds a general mathematical and algorithmic theory for balloon-twisting structures by modeling their underlying edge skeleta, evolving classic balloon animals into the new world of balloon polyhedra. What if Euler were a clown?

Erik D. Demaine | Martin L. Demaine | Vi Hart

[1] Van Riper,et al. Twisted: A Balloonamentary , 2010 .

[2] William G. Davids,et al. Experimental Test Methods for Inflatable Fabric Beams , 2008 .

[3] Katherine Heinrich,et al. P4-decompositions of regular graphs , 1999, J. Graph Theory.

[4] Mark Balzer. The History of Balloons , 1995 .

[5] Alexandr V. Kostochka,et al. Decomposing Graphs into Long Paths , 2003, Order.

[6] Ian Holyer,et al. The NP-Completeness of Some Edge-Partition Problems , 1981, SIAM J. Comput..

[7] Martin E. Dyer,et al. On the complexity of partitioning graphs into connected subgraphs , 1985, Discret. Appl. Math..

[8] Robert Johansson,et al. A note on edge-decompositions of planar graphs , 2004, Discret. Math..

[9] Zbigniew Lonc,et al. Polynomial cases of graph decomposition: A complete solution of Holyer's problem , 2009, Discret. Math..

[10] Katherine Heinrich,et al. P 4 -decompositions of regular graphs , 1999 .

[11] Michael Tarsi,et al. Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture , 1997, SIAM J. Comput..

[12] Jan Kratochvíl,et al. Edge decompositions of multigraphs into multi-2-paths , 2004 .

[13] Gerhard Reinelt,et al. On partitioning the edges of graphs into connected subgraphs , 1985, J. Graph Theory.