An algorithm for finding all the<i>k</i>-components of a digraph (Q3806837): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/00207168808803645 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2058454080 / rank | |||
Normal rank | |||
Revision as of 23:39, 19 March 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
