On Bipartite Drawings and the Linear Arrangement Problem

On Bipartite Drawings and the Linear Arrangement Problem

Cached

Download Links

by Farhad Shahrokhi, et al.

Citations:

BibTeX

@MISC{Shahrokhi_onbipartite,
    author = {Farhad Shahrokhi and et al.},
    title = {On Bipartite Drawings and the Linear Arrangement Problem},
    year = {}
}

Bookmark

OpenURL

Abstract

The bipartite crossing number problem is studied, and a connection between this problemand the linear arrangement problem is established. It is shown that when the arboricity is close

Citations

374	Combinatorial algorithms for integrated circuit layout - Lengauer - 1990
292	Methods for visual understanding of hierarchical system structures - Sugiyama, Tagawa, et al. - 1981
221	Algorithms for drawing graphs: An annotated bibliography - Eades, Tamassia - 1988
186	Crossing number is np-complete - Garey, Johnson - 1983
147	Combinatorial Geometry - Pach, Agarwal - 1995
100	Which aesthetic has the greatest effect on human understanding - PURCHASE - 1997
89	A survey of graph layout problems - Diaz, Petit, et al.
88	Complexity Issues in VLSI - Leighton - 1983
86	Divide-andconquer approximation algorithms via spreading metrics - Even, Naor, et al.
79	N.C.: Edge crossings in drawings of bipartite graphs - Eades, Wormald - 1994
73	The book thickness of a graph - Bernhart, Kainen - 1979
52	Optimal linear labelings and eigenvalues of graphs - Juvan, Mohar - 1992
43	Crossing theory and hierarchy mapping - Warfield - 1977
40	Fast approximate graph partitioning algorithms - Even, Naor, et al. - 1999
38	An Introduction to VLSI Physical Design - Sarrafzadeh, Wong - 1996
37	New approximation techniques for some ordering problems - Rao, Richa - 1998
26	An alternative method to crossing minimization on hierarchical graphs - Mutzel - 2001
25	A minimum linear arrangement algorithm for undirected trees - Shiloach - 1979
23	Edge crossings in drawings of bipartite graphs. Algorithmica - EADES, WORMALD - 1994
21	Approximate algorithms for geometric embeddings in the plane with applications parallel processing problems - Hansen - 1989
17	A.: A new crossing number for bipartite graphs - Harary, Schwenk - 1972
17	Exact and heuristic algorithms for 2layer straightline crossing minimization - Junger, Mutzel - 1995
16	Nash-Williams, Edge disjoint spanning trees of finite graphs - A - 1961
15	The assignment heuristic for crossing reduction - CATARCI - 1995
15	Probabilistic Graph Theory - White - 1995
14	On optimal linear arrangements of trees - Chung - 1984
13	A survey of graph layout problems - Daz, Petit, et al.
12	Edge disjoint spanning trees of finite graphs - Nash-Williams - 1961
9	A framework for solving VLSI layout problems - Bhatt, Leighton - 1984
9	On the bipartite crossing number - May, Szkatula - 1988
6	Which aesthetic has the greatest eect on human understanding - Purchase - 1997
6	2-layer straight line crossing minimization: performance of exact and heuristic algorithms - Junger, Mutzel - 1997
5	An approximate max flow min cut theorem for multicommodity flow problem with applications to approximation algorithm - Leighton, Rao - 1988
5	Bipartite permutation graphs, Discrete Applied Mathematics 18 - Spinrad, Brandstädt, et al. - 1987
4	Drawing graphs - Eades, Whitesides - 1994
3	A new Lower bound for the bipartite crossing number with algorithmic applications, submitted for publication - Shahrokhi, S'ykora, et al.
2	The optimal numbering of the vertices of a tree, Diskretnii Analiz 19 - Seidvasser - 1970
2	On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem - Shahrokhi, S'ykora, et al.
1	Drawing graphs in 2 layers, Theoret - Eades, Whitesides - 1994
1	The optimal numbering of the vertices of a tree, Diskret - Seidvasser - 1970
1	The book thickness of a graph, J. Combin. Theory B27 - Bernhart, Kainen - 1979
1	Which aesthetic has the greatest effect on human understanding - Pach, Agarwal, et al. - 1995