The MINSUMCUT problem
From MaRDI portal
Recommendations
- Parallel algorithms for the minimum cut and the minimum length tree layout problems
- A polynomial algorithm for the min-cut linear arrangement of trees
- A variation on the min cut linear arrangement problem
- Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees
- On optimal linear arrangements of trees
Cited in
(15)- Parallel algorithms for the minimum cut and the minimum length tree layout problems
- Vertex ordering and partitioning problems for random spatial graphs.
- Memory management optimization problems for integrated circuit simulators
- On the interval completion of chordal graphs
- An experimental comparison of variable neighborhood search variants for the minimization of the vertex-cut in layout problems
- Minimum cut with the fewest number of arcs
- Algorithms and bounds for L-drawings of directed graphs
- The scaling of the minimum sum of edge lengths in uniformly random trees
- Finding Folkman Numbers via MAX CUT Problem
- A polynomial algorithm for the min-cut linear arrangement of trees
- scientific article; zbMATH DE number 1783770 (Why is no real title available?)
- Graph layout problems
- Hardness and approximation of submodular minimum linear ordering problems
- On the proper interval completion problem within some chordal subclasses
- Fixed-parameter complexity of minimum profile problems
This page was built for publication: The MINSUMCUT problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4037408)
