Art

J-GLOBAL ID：201402293074667316   Reference number：14A0569349

Constant-time Delay Generation of Based Plane Triangulations

底辺付き極大平面グラフの定数時間遅延列挙

Author (4)： KOIDE Jun-ichi (Iwate Univ., Tokyo, JPN) ,  YAMANAKA Katsuhisa (Iwate Univ., Tokyo, JPN) ,  HIRAYAMA Takashi (Iwate Univ., Tokyo, JPN) ,  NISHITANI Yasuaki (Iwate Univ., Tokyo, JPN)
Material： 電子情報通信学会技術研究報告  (IEICE Technical Report (Institute of Electronics, Information and Communication Engineers))
Volume： 113  Issue： 488(COMP2013 60-73)  Page： 91-98  Publication year： Mar. 03, 2014 
JST Material Number： S0532B  ISSN： 0913-5685  Document type： Proceedings
Article type： 原著論文  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： *bottom face ,  *planar graph ,  *constant ,  *delay ,  triangle ,  *maximal value ,  algorithm ,  CPU time
Semi thesaurus term： detection algorithm ,  *time delay

JST classification (2)： Basics of graph theory  (IA02020S) ,  Theory of computation  (JB02000A)

Reference (10)：

• L.C. Aleardi, O. Devillers, and G. Schaeffer. Succinct representation of triangulations with a boundary. Proc. 9th Workshop on Algorithms and Data Structures (WADS 2005), LNCS 3608:134-145, 2005.
• L.C. Aleardi, O. Devillers, and G. Schaeffer. Succinct representations of planar maps. Theoretical Computer Science, 408:174-187, 2008.
• H. Arimura and T. Uno. An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence. Journal of Combinatorial Optimization, 13, 2007.
• D. Avis. Generating rooted triangulations without repetitions. Algorithmica, 16:618-632, 1996.
• D. Avis and K. Fukuda. Reverse search for enumeration. Discrete Applied Mathematics, 65(1-3):21-46, 1996.

Terms in the title (3)： 平面グラフ ,  定数 ,  時間遅延