Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem
From MaRDI portal
Recommendations
Cited in
(14)- Algorithms for the fixed linear crossing number problem
- Revising Johnson's table for the 21st century
- Complexity-separating graph classes for vertex, edge and total colouring
- An improved fixed-parameter algorithm for max-cut parameterized by crossing number
- The 2-page crossing number of \(K_{n}\)
- Book drawings of complete bipartite graphs
- Approximating the fixed linear crossing number
- An analysis of some linear graph layout heuristics
- The crossing number of the cone of a graph
- A variation on the min cut linear arrangement problem
- The crossing number of the cone of a graph
- The complexity of SIMPLE MAX-CUT on comparability graphs
- Parameterized algorithms for fixed-order book drawing with few crossings per edge
- Bound for the 2-page fixed linear crossing number of hypercube graph via SDP relaxation
This page was built for publication: Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3591323)