Pages that link to "Item:Q2931415"
From MaRDI portal
The following pages link to Hardness of cut problems in directed graphs (Q2931415):
Displaying 11 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)
- Max Horn SAT and the minimum cut problem in directed hypergraphs (Q1380929) (← links)
- Quasimetric embeddings and their applications (Q1799224) (← links)
- New results on planar and directed multicuts (Q2851464) (← links)
- Hardness of Graph Pricing Through Generalized Max-Dicut (Q2941530) (← links)
- Minimum Scan Cover with Angular Transition Costs (Q4997133) (← links)
- Odd Multiway Cut in Directed Acyclic Graphs (Q5111871) (← links)
- Finding and using directed cuts of real graphs of algorithms (Q5930916) (← links)