ARC crossing minimization in hierarchical digraphs with tabu search
From MaRDI portal
Publication:1373159
DOI10.1016/S0305-0548(96)00083-4zbMATH Open0883.90119OpenAlexW2030655309MaRDI QIDQ1373159FDOQ1373159
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
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
- A user's guide to tabu search
- Tabu Search—Part I
- Crossing Number is NP-Complete
- Algorithms for drawing graphs: An annotated bibliography
- How to Draw a Graph
- Title not available (Why is that?)
- Incremental bipartite drawing problem
- A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Crossing Theory and Hierarchy Mapping
- DAG—a program that draws directed graphs
- Title not available (Why is that?)
- Experiments on drawing 2-level hierarchical graphs
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
Uses Software
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)
