A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs
From MaRDI portal
Publication:1266546
DOI10.1016/0377-2217(95)00356-8zbMath0916.90264OpenAlexW2080431890MaRDI QIDQ1266546
Vicente Valls, Pilar Lino, Rafael Martí
Publication date: 7 October 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(95)00356-8
branch-and-boundbipartite graphsacyclic directed graphsautomatic graph drawingcrossing arcs minimization
Related Items
ARC crossing minimization in hierarchical digraphs with tabu search, A rearrangement of adjacency matrix based approach for solving the crossing minimization problem, 2-layer right angle crossing drawings, Crossing minimization in extended level drawings of graphs, Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization, Incremental bipartite drawing problem, Heuristics and meta-heuristics for 2-layer straight line crossing minimization, A tabu search algorithm for the bipartite drawing problem
Cites Work