A SPECIAL CROSSING NUMBER FOR BIPARTITE GRAPHS: A RESEARCH PROBLEM

DOI10.1111/j.1749-6632.1970.tb56499.xzbMath0226.05107OpenAlexW2019834521MaRDI QIDQ5632594

Mark E. Watkins

Publication date: 1970

Published in: Annals of the New York Academy of Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1749-6632.1970.tb56499.x

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

Genetic algorithms for drawing bipartite graphs ⋮ On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem ⋮ Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization ⋮ A new lower bound for the bipartite crossing number with applications ⋮ A tabu search algorithm for the bipartite drawing problem