6533b828fe1ef96bd1288cc2

RESEARCH PRODUCT

An Aggressive Search Procedure for the Bipartite Drawing Problem

Rafael Martí

subject

Mathematical optimizationGraph drawingBipartite graphSearch procedureForce-directed graph drawingMinificationHeuristicsGraphTabu searchMathematics

description

Graphs are used to represent reality in several areas of knowledge. This has generated considerable interest in graph drawing algorithms. Arc crossing minimization is a fundamental aesthetic criterion to obtain a readable map of a graph. The problem of minimizing the number of arc crossings in a bipartite graph (BDP) is NP-complete. In this paper we present an aggressive search scheme for the BDP based on the Intensification, Diversification and Strategic Oscillation elements of Tabu Search. Several algorithms can be obtained with this scheme by implementing different evaluators in the move definitions. In this paper we propose two variants. Computational results are reported on a set of 300 randomly generated test problems. The two algorithms have been compared with the best heuristics published in the literature and, for limited-size instances, with the optimal solutions.

yearjournalcountryeditionlanguage
1996-01-01
https://doi.org/10.1007/978-1-4613-1361-8_7