An algorithm for finding all the<i>k</i>-components of a digraph (Q3806837)
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 for finding all thek-components of a digraph |
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
