On the one-sided crossing minimization in a bipartite graph with large degrees
From MaRDI portal
Publication:1770400
DOI10.1016/j.tcs.2004.10.042zbMath1142.68461MaRDI QIDQ1770400
Publication date: 6 April 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.10.042
Approximation algorithm; Graph drawing; Randomized algorithm; Bipartite graph; 2-layered drawing; Edge crossing
90C35: Programming involving graphs or networks
68W05: Nonnumerical algorithms
68R10: Graph theory (including graph drawing) in computer science
05C10: Planar graphs; geometric and topological aspects of graph theory
68W25: Approximation algorithms
68W20: Randomized algorithms
05C62: Graph representations (geometric and intersection representations, etc.)
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
- 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
- Trees with Hamiltonian square
- Graph Drawing
- Graph Drawing
- Experiments on drawing 2-level hierarchical graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item