Pages that link to "Item:Q313969"
From MaRDI portal
The following pages link to The label cut problem with respect to path length and label frequency (Q313969):
Displaying 6 items.
- Refined parameterizations for computing colored cuts in edge-colored graphs (Q2082563) (← links)
- Colored cut games (Q2087453) (← links)
- Minimum label \(s\)-\(t\) cut has large integrality gaps (Q2216106) (← links)
- Hypergraph \(k\)-cut in randomized polynomial time (Q2227530) (← links)
- Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs (Q3297773) (← links)
- Maximum cuts in edge-colored graphs (Q5918845) (← links)
