Augmenting Graphs to Meet Edge-Connectivity Requirements (Q3989009): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56519177, #quickstatements; #temporary_batch_1709751086066 |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4367329880 / rank | |||
Normal rank | |||
Latest revision as of 19:21, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Augmenting Graphs to Meet Edge-Connectivity Requirements |
scientific article |
Statements
Augmenting Graphs to Meet Edge-Connectivity Requirements (English)
0 references
28 June 1992
0 references
combinatorial optimization
0 references
edge-connectivity
0 references
polynomial time algorithm
0 references
splitting theorems
0 references
polymatroids
0 references
