Efficient algorithms for the problems of enumerating cuts by non-decreasing weights (Q848944): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s00453-009-9284-5 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2020816761 / rank | |||
Normal rank |
Revision as of 01:13, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Efficient algorithms for the problems of enumerating cuts by non-decreasing weights |
scientific article |
Statements
Efficient algorithms for the problems of enumerating cuts by non-decreasing weights (English)
0 references
23 February 2010
0 references
algorithms
0 references
graphs
0 references
minimum cuts
0 references
maximum flows
0 references
suboptimal cuts
0 references
enumeration
0 references