A new lower bound for the bipartite crossing number with applications

Authors:
Farhad Shahrokhi;Ondrej Sýkora;László A. Székely;Imrich Vrt'o
Affiliations:
Univ. of North Texas, Denton;Loughborough Univ., Loughborough, UK;Univ. of South Carolina, Columbia;Institute for Mathematics, Bratislava, Slovak Republic
Venue:
Theoretical Computer Science
Year:
2000

Citing 0
Cited 4

Heuristics, Experimental Subjects, and Treatment Evaluation in Bigraph Crossing Minimization

Journal of Experimental Algorithmics (JEA)
A parallel approach to row-based VLSI layout using stochastic hill-climbing

IEA/AIE'2003 Proceedings of the 16th international conference on Developments in applied artificial intelligence
New exact results and bounds for bipartite crossing numbers of meshes

GD'04 Proceedings of the 12th international conference on Graph Drawing
A heuristic for bottleneck crossing minimization and its performance on general crossing minimization: Hypothesis and experimental study

Journal of Experimental Algorithmics (JEA)

Quantified Score

Hi-index	5.23

Visualization

Abstract