Pages that link to "Item:Q1317480"
From MaRDI portal
The following pages link to A faster parametric minimum-cut algorithm (Q1317480):
Displaying 11 items.
- Faster parameterized algorithms for minor containment (Q650942) (← links)
- Structural and algorithmic properties for parametric minimum cuts (Q715078) (← links)
- Fully-dynamic min-cut (Q925139) (← links)
- A fast algorithm for the generalized parametric minimum cut problem and applications (Q1186785) (← links)
- Complexity results for the \(p\)-median problem with mutual communication (Q1317006) (← links)
- The least element property of center location on tree networks with applications to distance and precedence constrained problems (Q1319019) (← links)
- Computing maximum mean cuts (Q1329796) (← links)
- Parametric analysis of overall min-cuts and applications in undirected networks. (Q1853178) (← links)
- A simple and fast min-cut algorithm (Q2642908) (← links)
- (Q2753925) (← links)
- Optimal hierarchical clustering on a graph (Q6065857) (← links)