共 50 条
- [23] Force-directed drawing method for intersecting clustered graphs [J]. ASIA-PACIFIC SYMPOSIUM ON VISUALISATION 2007, PROCEEDINGS, 2007, : 85 - 92
- [24] Three-Dimensional Orthogonal Graph Drawing with Optimal Volume [J]. Algorithmica, 2006, 44 : 233 - 255
- [25] Three-dimensional orthogonal graph drawing with optimal volume [J]. ALGORITHMICA, 2006, 44 (03) : 233 - 255
- [26] Graduate Workshop Recent Trends in Graph Drawing: Curves, Graphs, and Intersections [J]. GRAPH DRAWING AND NETWORK VISUALIZATION, GD 2015, 2015, 9411 : 541 - 541
- [27] Fast convergence layout algorithm for drawing graphs in marching-graph [J]. Ruan Jian Xue Bao/Journal of Software, 2008, 19 (08): : 1920 - 1932
- [28] A heuristic algorithm for drawing flow diagrams of energy systems using graph theory [J]. OCOS 2000: FROM THERMO-ECONOMICS TO SUSTAINABILITY, PTS 1-4, 2000, : 1743 - 1754
- [29] Data Compression as a Comprehensive Framework for Graph Drawing and Representation Learning [J]. KDD '20: PROCEEDINGS OF THE 26TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY & DATA MINING, 2020, : 1212 - 1222