The following pages link to Labeled cuts in graphs (Q313962):
Displaying 6 items.
- The label cut problem with respect to path length and label frequency (Q313969) (← links)
- Approximation and hardness results for label cut and related problems (Q630189) (← links)
- Efficient heuristics for the minimum labeling global cut problem (Q1791898) (← links)
- Maximum reachability preserved graph cut (Q2202008) (← links)
- Minimum label \(s\)-\(t\) cut has large integrality gaps (Q2216106) (← links)
- How to Cut a Graph into Many Pieces (Q3010400) (← links)