ARC crossing minimization in hierarchical digraphs with tabu search

DOI10.1016/S0305-0548(96)00083-4MaRDI QIDQ1373159zbMATH OpenOpenAlexFDO

Authors Manuel Laguna, Rafael Martí, Vicente Valls

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)

Recommendations

• Minimizing crossings in hierarchical digraphs with a hybridized genetic algorithm
• A tabu thresholding algorithm for arc crossing minimization in bipartite graphs
• A tabu search algorithm for the bipartite drawing problem
• scientific article; zbMATH DE number 1054930
• A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs

Cites work

• scientific article; zbMATH DE number 3963860 (Why is no real title available?)
• scientific article; zbMATH DE number 30296 (Why is no real title available?)
• scientific article; zbMATH DE number 1054930 (Why is no real title available?)
• scientific article; zbMATH DE number 1488569 (Why is no real title available?)
• A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs
• A user's guide to tabu search
• Algorithms for drawing graphs: An annotated bibliography
• Crossing Number is NP-Complete
• Crossing Theory and Hierarchy Mapping
• DAG—a program that draws directed graphs
• Experiments on drawing 2-level hierarchical graphs
• How to Draw a Graph
• Incremental bipartite drawing problem
• Tabu Search—Part I

Cited in

(7)

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

Describes a project that uses

Uses Software

• Tabu search

This page was built for publication: ARC crossing minimization in hierarchical digraphs with tabu search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1373159)