An algorithm for finding all the<i>k</i>-components of a digraph (Q3806837): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:38, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for finding all the<i>k</i>-components of a digraph |
scientific article |
Statements
An algorithm for finding all the<i>k</i>-components of a digraph (English)
0 references
1988
0 references
connectivity
0 references
network flow
0 references
k-component
0 references
digraph
0 references
vertex separator
0 references
