scientific article; zbMATH DE number 2196291

MaRDI QIDQ5465124zbMATHFDO

Authors Petra Mutzel, Michael Jünger

Publication date 22 August 2005

zbMATH Keywords

planarizationcrossing minimizationcompactionbend minimizationautomatic layouts of graphs

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Integer programming (90C10)

Recommendations

• scientific article; zbMATH DE number 5606407
• scientific article; zbMATH DE number 1974120
• Drawing graphs with mathematical programming and variable neighborhood search
• On multi-objective optimization aided drawing of special graphs
• Drawing Huge Graphs by Algebraic Multigrid Optimization
• scientific article; zbMATH DE number 1594517
• Graphical approach to combinatorial optimization
• scientific article; zbMATH DE number 219263

Cited in

(12)

• Heuristics for the constrained incremental graph drawing problem
• An SDP approach to multi-level crossing minimization
• On Turn-Regular Orthogonal Representations
• Multi-objective optimization aided to allocation of vertices in aesthetic drawings of special graphs
• An exact approach to upward crossing minimization
• Mathematical programs for drawing nonplanar graphs in the plane
• Optimal \(k\)-level planarization and crossing minimization
• Graph graphics: Theory and practice
• Finding all minimum cost flows and a faster algorithm for the \(K\) best flow problem
• An annotated bibliography on 1-planarity
• Tabu search for min-max edge crossing in graphs
• Drawing graphs with mathematical programming and variable neighborhood search

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 Q5465124)