2018 旭硝子財団 助成研究発表会 要旨集

137/198

23 [2] 1 O(n456.5 r1891 /121) [3]n r n (n-1)43 261 65ZDD 54 3003,00010310910121018 ZDD 2020 3. 1x1x1 (6) 111x3x3 (30) 37,054,664,336 (37) 1x3x51 4. [1] J. Kawahara et. al, Frontier-based search for enumer- ating all constrained subgraphs with compressed repre- sentation, IEICE Trans., E100-A (2017), 1773-1784. [2] A. Lubiw and J. O'Rourke, When can a polygon fold to a polytope?, Technical Report 048, Dept. of Computer Science, Smith College. [3] D. Kane, et. al, A pseudopolynomial algorithm for Alexandrov's theorem, In Proc. 11th Workshop on Algo. and Data Structures, LNCS 5664, 435-446, 2009. 5. 338-8570 255 horiyama@al.ics.saitama-u.ac.jp －129－