Increasing the rooted connectivity of a digraph by one (Q1300061): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q186111 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Matúš Harminc / rank | |||
Normal rank | |||
Revision as of 20:19, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Increasing the rooted connectivity of a digraph by one |
scientific article |
Statements
Increasing the rooted connectivity of a digraph by one (English)
0 references
30 January 2000
0 references
A two-phase greedy algorithm (when appropriately specialized) to find a minimum cost of new edges whose addition to a digraph increases the rooted connectivity by one is presented. The methods of \textit{D. F. Kornblum} [Proc. 9th southeast conf. on Combinatorics, graph theory and computing, Boca Raton 1978, 437-455 (1978; Zbl 0407.90089)] and \textit{D. R. Fulkerson} [Math. Program. 6, 1-13 (1974; Zbl 0283.05104)] are unified.
0 references
greedy algorithm
0 references
digraph
0 references
rooted connectivity
0 references
