Pages that link to "Item:Q719273"
From MaRDI portal
The following pages link to On the hardness of finding near-optimal multicuts in directed acyclic graphs (Q719273):
Displaying 6 items.
- Approximating minimum feedback sets and multicuts in directed graphs (Q1386376) (← links)
- Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth (Q2290633) (← links)
- Multicuts in unweighted digraphs with bounded degree and bounded tree-width (Q2741506) (← links)
- New results on planar and directed multicuts (Q2851464) (← links)
- Odd Multiway Cut in Directed Acyclic Graphs (Q5111871) (← links)
- Finding and using directed cuts of real graphs of algorithms (Q5930916) (← links)