Multiterminal xcut problems (Q1179738): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Some New Matroids on Graphs: Cut Sets and the Max Cut Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Multi-Terminal Network Flows / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Multi-terminal maximum flows in node-capacitated networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Extracting maximal information about sets of minimum cuts / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solution Bases of Multiterminal Cut Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An algorithm for computing maximum solution bases / rank | |||
Normal rank |
Revision as of 12:50, 15 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Multiterminal xcut problems |
scientific article |
Statements
Multiterminal xcut problems (English)
0 references
27 June 1992
0 references
\(i-j\) xcut
0 references