scientific article; zbMATH DE number 1054930

MaRDI QIDQ4350040zbMATH OpenFDO

Authors Rafael Martí

Publication date 8 December 1997

zbMATH Keywords

bipartite graphtabu searchneighbourhood searcharc crossing minimizationgraph drawing algorithmsaggressive search scheme

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Programming involving graphs or networks (90C35)

Recommendations

• A tabu search algorithm for the bipartite drawing problem
• Tabu search for the dynamic bipartite drawing problem
• Incremental bipartite drawing problem
• On bipartite drawings and the linear arrangement problem
• scientific article; zbMATH DE number 4128387
• scientific article; zbMATH DE number 1974130
• Solving matching problems efficiently in bipartite graphs
• scientific article; zbMATH DE number 2159164
• A fast dynamic optimum algorithm for maximum matching in bipartite graphs

Cited in

(9)

• Incremental bipartite drawing problem
• ARC crossing minimization in hierarchical digraphs with tabu search
• Metaheuristics: A bibliography
• scientific article; zbMATH DE number 4128387 (Why is no real title available?)
• A tabu search algorithm for the bipartite drawing problem
• scientific article; zbMATH DE number 1974130 (Why is no real title available?)
• Tabu search for the dynamic bipartite drawing problem
• Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization
• Tabu search for min-max edge crossing in graphs

This page was built for publication:

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