Crossing Minimization in Weighted Bipartite Graphs
From MaRDI portal
Publication:5432313
DOI10.1007/978-3-540-72845-0_10zbMath1203.68119OpenAlexW1836100053MaRDI QIDQ5432313
Ömer Karataş, Melih Sözdinler, Olca A. Çakıroḡlu, Cesim Erten
Publication date: 2 January 2008
Published in: Experimental Algorithms (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/11729/2999
Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items
A rearrangement of adjacency matrix based approach for solving the crossing minimization problem ⋮ Ranking and Drawing in Subexponential Time