Incremental bipartite drawing problem

DOI10.1016/S0305-0548(00)00040-XMaRDI QIDQ5955967zbMATH OpenWikidataFDO

Authors Rafael Martí, Vicente Estruch

Publication date 23 June 2002

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

Full work available at URL https://doi.org/10.1016/S0305-0548(00)00040-X

zbMATH Keywords

Combinatorial optimizationGraph drawingHeuristic search

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Tabu search for the dynamic bipartite drawing problem
• scientific article; zbMATH DE number 1054930
• A tabu search algorithm for the bipartite drawing problem
• Edge crossings in drawings of bipartite graphs
• Heuristics for the constrained incremental graph drawing problem

Cites work

• A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs
• A probabilistic heuristic for a computationally difficult set covering problem
• A tabu search algorithm for the bipartite drawing problem
• GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
• Greedy randomized adaptive search procedures
• scientific article; zbMATH DE number 437527 (Why is no real title available?)
• scientific article; zbMATH DE number 2123123 (Why is no real title available?)
• The NP-completeness column: An ongoing guide

Cited in

(13)

• ARC crossing minimization in hierarchical digraphs with tabu search
• A tabu search algorithm for the bipartite drawing problem
• Heuristics for the constrained incremental graph drawing problem
• Tabu search for the dynamic bipartite drawing 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
• A variable depth neighborhood search algorithm for the min-max arc crossing problem
• Efficient automated schematic map drawing using multiobjective mixed integer programming
• scientific article; zbMATH DE number 1054930 (Why is no real title available?)
• scientific article; zbMATH DE number 1974130 (Why is no real title available?)
• scientific article; zbMATH DE number 2080116 (Why is no real title available?)
• An efficient hybridization of graph representation learning and metaheuristics for the constrained incremental graph drawing problem

Describes a project that uses

Uses Software

• GraphBase

This page was built for publication: Incremental bipartite drawing problem

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