Pages that link to "Item:Q715078"
From MaRDI portal
The following pages link to Structural and algorithmic properties for parametric minimum cuts (Q715078):
Displaying 15 items.
- Lattice flows in networks (Q522926) (← links)
- Fully-dynamic min-cut (Q925139) (← links)
- On structural parameterizations of the matching cut problem (Q1708644) (← links)
- Parametric min-cuts analysis in a network. (Q1811086) (← links)
- Minimum cuts in parametric networks (Q1905228) (← links)
- Ordered optimal solutions and parametric minimum cut problems (Q2568331) (← links)
- Complexity of source-sink monotone 2-parameter min cut (Q2670479) (← links)
- Computing the Map of Geometric Minimal Cuts (Q3652210) (← links)
- A Fluid Model for One-Sided Bipartite Matching Queues with Match-Dependent Rewards (Q5031622) (← links)
- Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs (Q5076726) (← links)
- A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering (Q5270613) (← links)
- An optimal algorithm for the minimum edge cardinality cut surface problem (Q5361640) (← links)
- A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts (Q5418982) (← links)
- (Q5875545) (← links)
- A stronger lower bound on parametric minimum spanning trees (Q6103526) (← links)