A Geometric Heuristic for Rectilinear Crossing Minimization
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 7525513
- Heuristics and meta-heuristics for 2-layer straight line crossing minimization
- 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
- A greedy heuristic for crossing-angle maximization
- Linear-time heuristics for minimum weight rectangulation
- A heuristic for Euclidean and rectilinear Steiner problems
- Approximating the maximum rectilinear crossing number
- scientific article; zbMATH DE number 1500682
- Graph Drawing
- Approximating Crossing Minimization in Radial Layouts
Cited in
(12)- A greedy heuristic for crossing-angle maximization
- Heuristics and meta-heuristics for 2-layer straight line crossing minimization
- Stress-Plus-X (SPX) graph layout
- An effective crossing minimisation heuristic based on star insertion
- Crossing Minimisation Heuristics for 2-page Drawings
- Graph Drawing via Gradient Descent, (GD)^2
- scientific article; zbMATH DE number 7525513 (Why is no real title available?)
- Graph Drawing
- How to draw a planarization
- Computational search of small point sets with small rectilinear crossing number
- Inserting an edge into a geometric embedding
- Universal quality metrics for graph drawings: which graphs excite us most?
This page was built for publication: A Geometric Heuristic for Rectilinear Crossing Minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5232732)