A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs
The Study of Graph Drawing Algorithm
全件表示
論文 (32件):
Kazuyuki MIURA. Convex Grid Drawings of Internally Triconnected Plane Graphs with Pentagonal Contours. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. 2023. E106.A. 9. 1092-1099
Kazuyuki MIURA. Grid Drawings of Five-Connected Plane Graphs. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. 2022. E105.A. 9. 1228-1234
Kei Sato, Kazuyuki Miura. Convex Grid Drawings of Plane Graphs with Pentagonal Contours on O(n^2) grids. IEICE Transactions on Fundamentals of Electronics, Special Section on Discrete Mathematics and Its Applications. 2021. Vol.E104-A. No.09. 1142-1149
Kazuyuki Miura. Convex Grid Drawings of Plane Graphs with Hexagonal Contours. Proceedings of the 19th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2016). 2016. 1. 1. 5-1-5-8