Crossing Minimization in Weighted Bipartite Graphs

DOI10.1007/978-3-540-72845-0_10MaRDI QIDQ5432313zbMATH OpenOpenAlexFDO

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

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• Crossing minimization in weighted bipartite graphs
• On the one-sided crossing minimization in a bipartite graph with large degrees
• Crossing minimization in linear embeddings of graphs
• Maximum weighted matching with few edge crossings for 2-layered bipartite graph
• A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs
• Minimizing maximum weight of subsets of a maximum matching in a bipartite graph
• Graph Bipartization and via minimization
• Crossing and Weighted Crossing Number of Near-Planar Graphs
• An alternative method to crossing minimization on hierarchical graphs

Cited in

(10)

• Crossing minimization in weighted bipartite graphs
• On the one-sided crossing minimization in a bipartite graph with large degrees
• A tabu thresholding algorithm for arc crossing minimization in bipartite graphs
• Maximum weighted matching with few edge crossings for 2-layered bipartite graph
• On bipartite drawings and the linear arrangement problem
• Ranking and drawing in subexponential time
• A rearrangement of adjacency matrix based approach for solving the crossing minimization problem
• On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem
• Heuristics, experimental subjects, and treatment evaluation in bigraph crossing minimization
• Graph Drawing

This page was built for publication: Crossing Minimization in Weighted Bipartite Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5432313)