Pages that link to "Item:Q4819693"
From MaRDI portal
The following pages link to Multiway cuts in node weighted graphs (Q4819693):
Displaying 10 items.
- Multi-Budgeted Directed Cuts (Q5009480) (← links)
- (Q5009483) (← links)
- A deterministic polynomial kernel for odd cycle transversal and vertex multiway cut in planar graphs (Q5090489) (← links)
- A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs (Q5163509) (← links)
- Solving LP Relaxations of Some NP-Hard Problems Is As Hard As Solving Any Linear Program (Q5231683) (← links)
- Approximation Algorithms for k-Hurdle Problems (Q5458550) (← links)
- Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs (Q5915760) (← links)
- Node multiway cut and subset feedback vertex set on graphs of bounded mim-width (Q5970812) (← links)
- Vertex downgrading to minimize connectivity (Q6038644) (← links)
- Fission: Practical algorithms for computing minimum balanced node separators (Q6115756) (← links)
