Pages that link to "Item:Q2931415"
From MaRDI portal
The following pages link to Hardness of cut problems in directed graphs (Q2931415):
Displaying 7 items.
- On the advantage of overlapping clusters for minimizing conductance (Q472486) (← links)
- On the hardness of finding near-optimal multicuts in directed acyclic graphs (Q719273) (← links)
- On the complexity of the multicut problem in bounded tree-width graphs and digraphs (Q944745) (← links)
- Most balanced minimum cuts (Q968139) (← links)
- Quasimetric embeddings and their applications (Q1799224) (← links)
- New results on planar and directed multicuts (Q2851464) (← links)
- Minimum Scan Cover with Angular Transition Costs (Q4997133) (← links)
