scientific article; zbMATH DE number 1500685

MaRDI QIDQ4501706zbMATH OpenFDO

Authors Farhad Shahrokhi, Imrich Vrt'o

Publication date 4 September 2000

zbMATH Keywords

approximation algorithmcrossing numbercrossingslinear arrangement problemdrawings

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• Some provably hard crossing number problems
• An algorithm for the graph crossing number problem
• scientific article; zbMATH DE number 1796980
• On the parameterized complexity of layered graph drawing
• On bipartite drawings and the linear arrangement problem

Cited in

(2)

• Recognizing \(P_ 3\)-structure: A switching approach
• Graph Drawing

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