Pages that link to "Item:Q1386376"
From MaRDI portal
The following pages link to Approximating minimum feedback sets and multicuts in directed graphs (Q1386376):
Displaying 17 items.
- MINIMUM FEEDBACK ARC SETS IN ROTATOR AND INCOMPLETE ROTATOR GRAPHS (Q4902886) (← links)
- Multi-Budgeted Directed Cuts (Q5009480) (← links)
- Approximating minimum feedback sets and multi-cuts in directed graphs (Q5101402) (← links)
- Tight Localizations of Feedback Sets (Q5102049) (← links)
- An Exact Method for the Minimum Feedback Arc Set Problem (Q5102057) (← links)
- (Q5111250) (← links)
- Maximal Acyclic Subgraphs and Closest Stable Matrices (Q5146694) (← links)
- Voting Procedures, Complexity of (Q5150301) (← links)
- Aligning and Labeling Genomes under the Duplication-Loss Model (Q5326363) (← links)
- Inapproximability of $H$-Transversal/Packing (Q5348212) (← links)
- Parameterized algorithms for generalizations of directed feedback vertex set (Q5925617) (← links)
- Multi-robot motion planning for unit discs with revolving areas (Q6110072) (← links)
- Extremal results on feedback arc sets in digraphs (Q6119220) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- The connection of the acyclic disconnection and feedback arc sets -- on an open problem of Figueroa et al.. (Q6494939) (← links)
- Tree drawings with columns (Q6560148) (← links)
- A better LP rounding for feedback arc set on tournaments (Q6614011) (← links)