Crossing minimization in weighted bipartite graphs

DOI10.1016/J.JDA.2008.08.003zbMath1176.90486OpenAlexW2018593731MaRDI QIDQ1044030

Olca A. Çakıroḡlu, Cesim Erten, Melih Sözdinler, Ömer Karataş

Publication date: 10 December 2009

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2008.08.003

zbMATH Keywords

combinatorial optimizationapproximation algorithmscrossing minimizationweighted bipartite graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (1)

A variable depth neighborhood search algorithm for the min-max arc crossing problem

Uses Software

• LEDA
• GraphBase
• GSL
• visone

Cites Work

• Edge crossings in drawings of bipartite graphs
• New bounds on the barycenter heuristic for bipartite graph drawing.
• An improved bound on the one-sided minimum crossing number in two-layered drawings
• Crossing Number is NP-Complete
• Crossing Theory and Hierarchy Mapping
• 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
• Graph Drawing
• Breaking cycles for minimizing crossings
• Heuristics, Experimental Subjects, and Treatment Evaluation in Bigraph Crossing Minimization
• Graph Drawing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Crossing minimization in weighted bipartite graphs