Confluent Layered Drawings
暂无分享,去创建一个
[1] Emden R. Gansner,et al. Drawing graphs with dot , 2006 .
[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[3] Walter F. Tichy,et al. Edge: An extendible graph editor , 1990, Softw. Pract. Exp..
[4] Daniel Br. New Methods to Color the Vertices of a Graph , 1979 .
[5] J.l. Ramos. Model building in mathematical programming: Third Edition H.P. Williams John Wiley & Sons, New York, 1990, £14.50 , 1993 .
[6] Walter F. Tichy,et al. Edge: An extendible graph editor , 1990, Softw. Pract. Exp..
[7] Frank Thomson Leighton,et al. A Graph Coloring Algorithm for Large Scheduling Problems. , 1979, Journal of research of the National Bureau of Standards.
[8] David Eppstein,et al. Journal of Graph Algorithms and Applications Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way , 2022 .
[9] Emden R. Gansner,et al. A Technique for Drawing Directed Graphs , 1993, IEEE Trans. Software Eng..
[10] Xuemin Lin,et al. How to draw a directed graph , 1989, [Proceedings] 1989 IEEE Workshop on Visual Languages.
[11] Kevin Barraclough,et al. I and i , 2001, BMJ : British Medical Journal.
[12] Robert H. Henry,et al. Automatic layout of large directed graphs , 1988 .
[13] Michael Forster,et al. Applying Crossing Reduction Strategies to Layered Compound Graphs , 2002, GD.
[14] Michael Jünger,et al. Journal of Graph Algorithms and Applications 2-layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms , 2022 .
[15] F. J. Newbery. Edge concentration: a method for clustering directed graphs , 1989 .
[16] David S. Johnson,et al. Crossing Number is NP-Complete , 1983 .
[17] K. P. Vo,et al. DAG—a program that draws directed graphs , 1988, Softw. Pract. Exp..
[18] Lawrence A. Rowe,et al. A divide-and-conquer algorithm for the automatic layout of large directed graphs , 1991, IEEE Trans. Syst. Man Cybern..
[19] Peter C. Fishburn,et al. Bipartite dimensions and bipartite degrees of graphs , 1996, Discret. Math..
[20] Ondrej Sýkora,et al. Two New Heuristics for Two-Sided Bipartite Graph Drawing , 2002, Graph Drawing.
[21] Helen C. Purchase,et al. Which Aesthetic has the Greatest Effect on Human Understanding? , 1997, GD.
[22] Rolf Drechsler,et al. Crossing Reduction by Windows Optimization , 2002, GD.
[23] Marie-Jose Carpano,et al. Automatic Display of Hierarchized Graphs for Computer-Aided Decision Analysis , 1980, IEEE Transactions on Systems, Man, and Cybernetics.
[24] Daniel Brélaz,et al. New methods to color the vertices of a graph , 1979, CACM.
[25] Michael Jünger,et al. Simple and Efficient Bilayer Cross Counting , 2002, J. Graph Algorithms Appl..
[26] Xuemin Lin. On the computational complexity of edge concentration , 2000, Discret. Appl. Math..
[27] L. C. Thomas,et al. Model Building in Mathematical Programming (2nd Edition) , 1986 .
[28] Vance E. Waddle,et al. An E log E Line Crossing Algorithm for Levelled Graphs , 1999, Graph Drawing.
[29] Mitsuhiko Toda,et al. Methods for Visual Understanding of Hierarchical System Structures , 1981, IEEE Transactions on Systems, Man, and Cybernetics.