Author:
Chrobak Marek,Nakano Shin-ichi
Subject
Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications
Reference23 articles.
1. Nice drawings of graphs and of trees are computationally hard;Brandenburg,1998
2. Drawing planar graphs nicely;Chiba;Acta Informatica,1985
3. Linear algorithms for convex drawings of planar graphs;Chiba,1984
4. Convex grid drawings of 3-connected planar graphs;Chrobak,1993
5. A linear-time algorithm for drawing a planar graph on a grid;Chrobak;Inform. Process. Letters,1995
Cited by
32 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. An annotated review on graph drawing and its applications;AKCE International Journal of Graphs and Combinatorics;2023-07-11
2. Grid Drawings of Five-Connected Plane Graphs;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2022-09-01
3. Algorithms for Stable Matching and Clustering in a Grid;Lecture Notes in Computer Science;2017
4. Some Research Topics;Basic Graph Theory;2017
5. Snapping Graph Drawings to the Grid Optimally;Lecture Notes in Computer Science;2016