Pages that link to "Item:Q3445498"
From MaRDI portal
The following pages link to Maximum directed cuts in acyclic digraphs (Q3445498):
Displaying 18 items.
- Intersection properties of maximal directed cuts in digraphs (Q329544) (← links)
- Covering digraphs with small indegrees or outdegrees by directed cuts (Q389984) (← links)
- Covering the edges of digraphs in \(\mathcal D(3,3)\) and \(\mathcal D(4,4)\) with directed cuts (Q418854) (← links)
- An LP-rounding \(2\sqrt{2}\)-approximation for restricted maximum acyclic subgraph (Q477619) (← links)
- On the maximum arc-chromatic number of digraphs with bounded outdegrees or indegrees (Q495674) (← links)
- Maximum directed cuts in graphs with degree constraints (Q1926032) (← links)
- On judicious bipartitions of directed graphs (Q2144584) (← links)
- A bound on judicious bipartitions of directed graphs (Q2303909) (← links)
- Oblivious algorithms for the maximum directed cut problem (Q2346965) (← links)
- On bisections of directed graphs (Q2357220) (← links)
- Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization (Q2942658) (← links)
- Acyclic Digraphs (Q3120435) (← links)
- Maximum directed cuts in digraphs with degree restriction (Q3633002) (← links)
- On Maximum Edge Cuts of Connected Digraphs (Q5418765) (← links)
- Impact of soft ride time constraints on the complexity of scheduling in dial-a-ride problems (Q6040633) (← links)
- Partitioning digraphs with outdegree at least 4 (Q6056760) (← links)
- Optimal bisections of directed graphs (Q6185053) (← links)
- Bounds on maximum weight directed cut (Q6606913) (← links)
