On bipartite drawings and the linear arrangement problem

SIAM Journal on Computing

Volumn 30, Issue 6, 2000, Pages 1773-1789

  Shahrokhl, Farhad ^a   Sykora, Ondrej ^b   Szekely, Läszlö A ^c   Vrto, Imrich ^d  

^a UNIVERSITY OF NORTH TEXAS   (United States)

^b LOUGHBOROUGH UNIVERSITY   (United Kingdom)

^c UNIVERSITY OF SOUTH CAROLINA   (United States)

^d INSTITUTE OF CHEMISTRY   (Slovakia)

Author keywords

Approximation algorithms; Bipartite crossing number; Bipartite drawing; Biplanar graph; Linear arrangement

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; CIRCUIT THEORY; COMPUTATIONAL COMPLEXITY; POLYNOMIAL APPROXIMATION; THEOREM PROVING; VLSI CIRCUITS;

ACYCLIC GRAPH; APPROXIMATION ALGORITHMS; BIPARTITE CROSSING NUMBER; BIPARTITE DRAWINGS; BIPLANAR GRAPH; LINEAR ARRANGEMENT;

TREES (MATHEMATICS);

EID: 0035705976     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/s0097539797331671     Document Type: Article

References (28)

1. F. R. K. CIIUNG, On optimal linear arrangements of trees, Comput. Math. Appl., 10 (1984), pp. 43-60.
2. J. DIAZ, Graph layout problems, in Mathematical Foundations of Computer Science, Lecture Notes in Comput. Sei. 629, Springer-Verlag, Berlin, 1992, pp. 14-23.
3. J. Dl BATTISTA, P. EADES, R. TAMASSIA, AND I. G. Toms, Algorithms for drawing graphs: An annotated bibliography, Comput. Geom., 4 (1994), pp. 235-282.
4. P. EADES AND N. WORMALD, Edge crossings in drawings of bipartite graphs, Algorithmica, 11 (1994), pp. 379-403.
5. P. EADES AND S. WHITESIDES, Drawing graphs in 2 layers, Theoret. Comput. Sei., 131 (1994), pp. 361-374.
6. G. EVEN, J. NAOR, S. UAO, AND B. SCHIEBER, Divide-and-conquer approximation algorithms via spreading matrices, in Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, 1995, pp. 62-71.
7. G. EVEN, J. S. NAOR, S. RAO, AND B. SCHIEBER, Fast approximate graph partition algorithms, in Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 1997, pp. 639-648.
8. M. R. GAREY AND D. S. JOHNSON, Crossing number is NP-complete, SIAM J. Algebraic Discrete Methods, 4 (1983), pp. 312-316.
9. M. HANSEN, Approximate algorithms for geometric embeddings in the plane with applications ,to parallel processing problems, in the 30th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, 1989, pp. 604-609.
10. M. JÜNGER AND P. MUTZEL, 2 layer straight line crossing minimization: Performance of exact and heuristic algorithms , J. Graph Algorithms Appl., 1 (1997), pp. 1-25.
11. M. JUVAN AND B. MoilAR, Optimal linear labelings and eigenvalues of graphs, Discrete Appl. Math., 36 (1992), pp. 153-168.
12. F. T. LEIGHTON, Complexity Issues in VLSI, MIT Press, Cambridge, MA, 1983.
13. F. T. LEIGHTON AND S. RAO, An approximate max flow min cut theorem for multicommodity flow problem with applications to approximation algorithm, in the 29th Annual IEEE Sym-posium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, 1988, pp. 422-431.
14. M. MAY AND K. SZKATULA, On the bipartite crossing number, Control Cybernet., 17 (1988), pp. 85-98.
15. P. MUTZEL, An alternative method to crossing minimization on hierarchical graphs, in Symposium on Graph Drawing, Lecture Notes in Comput. Sei. 1190, Springer-Verlag, Berlin, 1997, pp. 318-333.
16. C. ST. J. A. NASH-WILLIAMS, Edge disjoint spanning trees of finite graphs, J. London Math. Soc., 36 (1961), pp. 445-450
17. J. PACH AND P. K. AGARWAL, Combinatorial Geometry, John Wiley, New York, 1995.
18. H. PURCHASE, Which aesthetic has the greatest effect on human understanding?, in Symposium on Graph Drawing, Lecture Notes in Comput. Sei. 1353, Springer-Verlag, Berlin, 1998, pp. 248-261
19. S. RAO AND A. RICHA, New approximation techniques for some ordering problems, in Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 1998, pp. 211-218.
20. M. A. SEIDVASSER, The optimal numbering of the vertices of a tree, Diskret. Analiz, 19 (1970), pp. 56-74.
21. F. SIIAHROKHI, O. SYKORA, L. A. SZéKELY, AND I. VRTO, On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem, in Workshop on Algorithms and Data Structures, Lecture Notes in Comput. Sei. 1272, Springer-Verlag, Berlin, 1998, pp. 55-68.
22. F. SHAHROKHI, O. SYKORA, L. A. SZéKELY, AND I. VRTO, A new lower bound for the bipartite crossing number with algorithmic applications, in Symposium on Graph Drawing, Lecture Notes in Comput. Sei. 1353, Springer-Verlag, Berlin, 1998, pp. 37-46.
23. Extended version appeared in Theoret. Comput. Sei., 245 (2000), pp. 281-294.
24. Y. SHILOACH, A minimum linear arrangement algorithm for undirected trees, SIAM J. Comput., 8 (1979), pp. 15-32.
25. K. SUGIYAMA, S. TAGAWA, AND M. TODA, Methods for visual understanding of hierarchical systems structures, IEEE Trans. Systems Man Cybernet., 11 (1981), pp. 109-125.
26. N. TOMII, Y. KAMBAYASHI, AND Y. SHUZO, On planarization algorithms of the 1-level graphs, IECEJ, EC77-38 (1977), pp. 1-12.
27. V. VALLS, R. MARTI, AND P. LINO, A branch and bound algorithm for minimizing the number of crossings arcs in bipartite graphs, European J. Oper. Res., 90 (1996), pp. 303-319.
28. A. T. WHITE AND L. W. BEINEKE, Topological graph theory, in Selected Topics in Graph Theory, L. W. Beineke and R. J. Wilson, eds., Academic Press, New York, 1978, pp. 15-50.