Pages that link to "Item:Q5418765"
From MaRDI portal
The following pages link to On Maximum Edge Cuts of Connected Digraphs (Q5418765):
Displaying 9 items.
- \textsc{max-cut} and containment relations in graphs (Q441861) (← links)
- On the existence of edge cuts leaving several large components (Q1024487) (← links)
- A note on line digraphs and the directed max-cut problem (Q1174433) (← links)
- Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdős inequality (Q1297468) (← links)
- Node and edge relaxations of the max-cut problem (Q1319044) (← links)
- A bound on judicious bipartitions of directed graphs (Q2303909) (← links)
- (Q3134394) (← links)
- Graph partitioning: an updated survey (Q6110873) (← links)
- Bounds on maximum weight directed cut (Q6606913) (← links)