Drawing bipartite graphs in two layers with specified crossings

DOI10.1007/978-3-030-11509-8_9OpenAlexW2911009386MaRDI QIDQ2326569FDOQ2326569

Authors: Ajit A. Diwan, Bodhayan Roy, Subir Kumar Ghosh 

Publication date: 10 October 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-11509-8_9

Recommendations

• Two-layer drawings of bipartite graphs
• Drawing graphs in two layers
• An improved bound on the one-sided minimum crossing number in two-layered drawings
• A faster fixed parameter algorithm for two-layer crossing minimization
• Counting edge crossings in a 2-layered drawing

zbMATH Keywords

bipartite graphpermutation graphabstract topological graphtwo-layer drawing

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited In (9)

• Title not available (Why is that?)
• Two-layer drawings of bipartite graphs
• A faster fixed parameter algorithm for two-layer crossing minimization
• 2-layer right angle crossing drawings
• 2-layer right angle crossing drawings
• 2-Layer Graph Drawings with Bounded Pathwidth
• Counting edge crossings in a 2-layered drawing
• Drawing Bipartite Graphs on Two Parallel Convex Curves
• Drawing Bipartite Graphs on Two Curves

This page was built for publication: Drawing bipartite graphs in two layers with specified crossings

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