An algorithm to increase the node-connectivity of a digraph by one (Q955325)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm to increase the node-connectivity of a digraph by one |
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
