Pages that link to "Item:Q5410648"
From MaRDI portal
The following pages link to Efficient Algorithms for the Label Cut Problems (Q5410648):
Displaying 9 items.
- Labeled cuts in graphs (Q313962) (← links)
- 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)
- Simpler and better approximation algorithms for the unweighted minimum label \(s\)-\(t\) cut problem (Q1702134) (← links)
- Efficient heuristics for the minimum labeling global cut problem (Q1791898) (← links)
- Maximum reachability preserved graph cut (Q2202008) (← links)
- (Q4997758) (← links)
- Maximum cuts in edge-colored graphs (Q5918845) (← links)
- New algorithms for the minimum coloring cut problem (Q6066619) (← links)