Edge crossings in drawings of bipartite graphs
暂无分享,去创建一个
[1] J. A. Bondy,et al. Graph Theory with Applications , 1978 .
[2] Daniel J. Rosenkrantz,et al. An Analysis of Several Heuristics for the Traveling Salesman Problem , 1977, SIAM J. Comput..
[3] David Kelly. Fundamentals of planar ordered sets , 1987, Discret. Math..
[4] Kozo Sugiyama. Drawing and Understanding Systems Structures: An Introduction to the Sketch System , 1982 .
[5] Xuemin Lin,et al. How to draw a directed graph , 1989, [Proceedings] 1989 IEEE Workshop on Visual Languages.
[6] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[7] Howard Trickey,et al. Drag: a graph drawing system , 1988 .
[8] David S. Johnson,et al. Crossing Number is NP-Complete , 1983 .
[9] Enrico Nardelli,et al. An Algorithm for Testing Planarity of Hierarchical Graphs , 1987, WG.
[10] Erkki Mäkinen,et al. Experiments on drawing 2-level hierarchical graphs , 1990, Int. J. Comput. Math..
[11] John N. Warfield,et al. Crossing Theory and Hierarchy Mapping , 1977, IEEE Transactions on Systems, Man, and Cybernetics.
[12] Lawrence A. Rowe,et al. A browser for directed graphs , 1987, Softw. Pract. Exp..
[13] Xuemin Lin,et al. A heuristic for the feedback arc set problem , 1995, Australas. J Comb..
[14] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[15] Brendan D. McKay,et al. On an edge crossing problem , 1986 .
[16] K. P. Vo,et al. DAG—a program that draws directed graphs , 1988, Softw. Pract. Exp..
[17] Mitsuhiko Toda,et al. Methods for Visual Understanding of Hierarchical System Structures , 1981, IEEE Transactions on Systems, Man, and Cybernetics.
[18] Bonnie Berger,et al. Approximation alogorithms for the maximum acyclic subgraph problem , 1990, SODA '90.
[19] Carlo Batini,et al. Automatic graph drawing and readability of diagrams , 1988, IEEE Trans. Syst. Man Cybern..
[20] Roberto Tamassia. Drawing algorithms for planar st-graphs , 1990, Australas. J Comb..