An algorithm to increase the node-connectivity of a digraph by one (Q955325): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/disopt/FrankV08, #quickstatements; #temporary_batch_1731475607626 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/disopt/FrankV08 / rank | |||
Normal rank | |||
Latest revision as of 06:38, 13 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm to increase the node-connectivity of a digraph by one |
scientific article |
Statements
An algorithm to increase the node-connectivity of a digraph by one (English)
0 references
19 November 2008
0 references
graph algorithms
0 references
connectivity augmentation
0 references
