A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs
type: Item
instance of: scholarly article
title: A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs
zbMATH Open document ID: 0916.90264
DOI: 10.1016/0377-2217(95)00356-8
author: Vicente Valls
author: Rafael Martí
author: Pilar Lino
published in: European Journal of Operational Research
publication date: 1998-10-07T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 1208480
zbMATH Keywords: crossing arcs minimization
zbMATH Keywords: automatic graph drawing
zbMATH Keywords: bipartite graphs
zbMATH Keywords: acyclic directed graphs
zbMATH Keywords: branch-and-bound
MaRDI profile type: Publication
full work available at URL: 0377-2217(95)00356-8
OpenAlex ID: W2080431890
cites work: Hierarchies and planarity theory
cites work: Algorithms for drawing graphs: An annotated bibliography
cites work: Q3731621
cites work: The NP-completeness column: An ongoing gulde
cites work: Experiments on drawing 2-level hierarchical graphs
cites work: Q4144192
cites work: Crossing Theory and Hierarchy Mapping
description: scientific article; zbMATH DE number 1208480