O(n) and O(n2) Time Algorithms for Drawing Problems of Tree-Structured Diagrams

Tadaaki Kirishima, Tomoo Sumida, Yasunori Shiono, Takaaki Goto, Takeo Yaku, Tetsuro Nishino, Kensei Tsuchida. O(n) and O(n2) Time Algorithms for Drawing Problems of Tree-Structured Diagrams. In Teruhisa Hochin, Roger Y. Lee, editors, 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2012, Kyoto, Japan, August 8-10, 2012. pages 530-535, IEEE Computer Society, 2012. [doi]

Abstract

Abstract is missing.