Pages that link to "Item:Q722541"
From MaRDI portal
The following pages link to Linear kernels and linear-time algorithms for finding large cuts (Q722541):
Displaying 4 items.
- An improved kernel for max-bisection above tight lower bound (Q1985605) (← links)
- Fixed-parameter algorithms for the weighted max-cut problem on embedded 1-planar graphs (Q2220841) (← links)
- Odd Multiway Cut in Directed Acyclic Graphs (Q3300762) (← links)
- Finding Detours is Fixed-Parameter Tractable (Q4972756) (← links)
