On maximum edge cuts of connected digraphs
From MaRDI portal
Recommendations
- Maximum directed cuts in acyclic digraphs
- Maximum directed cuts in graphs with degree constraints
- Covering the edges of digraphs in \(\mathcal D(3,3)\) and \(\mathcal D(4,4)\) with directed cuts
- Maximum directed cuts in digraphs with degree restriction
- Lower bounds of \(|X|\) and \(|Y|\) of edge-cut \( (X,Y)\) and maximality and superiority of a digraph
Cites work
- Largest bipartite subgraphs in triangle-free graphs with maximum degree three
- Maximum directed cuts in acyclic digraphs
- Maximum directed cuts in digraphs with degree restriction
- Maximum directed cuts in graphs with degree constraints
- Optimization, approximation, and complexity classes
- Triangle-free subcubic graphs with minimum bipartite density
Cited in
(16)- On the existence of edge cuts leaving several large components
- A note on line digraphs and the directed max-cut problem
- Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdős inequality
- Node and edge relaxations of the max-cut problem
- Maximum directed cuts in graphs with degree constraints
- A bound on judicious bipartitions of directed graphs
- scientific article; zbMATH DE number 6837056 (Why is no real title available?)
- Intersection properties of maximal directed cuts in digraphs
- Maximum directed cuts in acyclic digraphs
- Maximum directed cuts in digraphs with degree restriction
- scientific article; zbMATH DE number 4101224 (Why is no real title available?)
- Covering digraphs with small indegrees or outdegrees by directed cuts
- \textsc{max-cut} and containment relations in graphs
- Graph partitioning: an updated survey
- Bounds on maximum weight directed cut
- Bisections of directed graphs without complete bipartite subgraphs
This page was built for publication: On maximum edge cuts of connected digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5418765)
