Heuristics, Experimental Subjects, and Treatment Evaluation in Bigraph Crossing Minimization

DOI10.1145/945394.945402zbMath1365.68360OpenAlexW1979053278MaRDI QIDQ5269371

Matthias F. M. Stallmann, Debabrata Ghosh, Franc Brglez

Publication date: 15 June 2017

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/945394.945402

zbMATH Keywords

design of experimentscrossing numbergraph drawinggraph embeddinglayoutgraph equivalence classes

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (5)

Tabu search for the dynamic bipartite drawing problem ⋮ Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization ⋮ On SAT instance classes and a method for reliable performance experiments with SAT solvers ⋮ Mathematical methods for physical layout of printed circuit boards: an overview ⋮ Crossing minimization in weighted bipartite graphs

This page was built for publication: Heuristics, Experimental Subjects, and Treatment Evaluation in Bigraph Crossing Minimization