Pages that link to "Item:Q2955012"
From MaRDI portal
The following pages link to Minimum cost flows in graphs with unit capacities (Q2955012):
Displaying 5 items.
- Minimum-cost flows in unit-capacity networks (Q1693987) (← links)
- Parameterized algorithms and kernels for almost induced matching (Q2210504) (← links)
- Almost Induced Matching: Linear Kernels and Parameterized Algorithms (Q3181060) (← links)
- Holiest minimum-cost paths and flows in surface graphs (Q5230385) (← links)
- A \(5k\)-vertex kernel for 3-path vertex cover (Q6041673) (← links)