ARC crossing minimization in hierarchical digraphs with tabu search

DOI10.1016/S0305-0548(96)00083-4zbMath0883.90119OpenAlexW2030655309MaRDI QIDQ1373159

Vicente Valls, Rafael Martí, Manuel Laguna

Publication date: 6 November 1997

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(96)00083-4

zbMATH Keywords

graph drawinginsertion mechanismmulti-layer hierarchical digraph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

A variable depth neighborhood search algorithm for the min-max arc crossing problem, Variable neighborhood descent for the incremental graph drawing, Variable neighborhood scatter search for the incremental graph drawing problem, Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization, Minimizing crossings in hierarchical digraphs with a hybridized genetic algorithm, Heuristics and meta-heuristics for 2-layer straight line crossing minimization

Uses Software

• Tabu search

Cites Work

• A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs
• Algorithms for drawing graphs: An annotated bibliography
• A user's guide to tabu search
• Crossing Number is NP-Complete
• DAG—a program that draws directed graphs
• Tabu Search—Part I
• Crossing Theory and Hierarchy Mapping
• How to Draw a Graph
• Experiments on drawing 2-level hierarchical graphs
• Incremental bipartite drawing problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item