On finding all unilaterally connected components of a digraph (Q1234170)
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: On finding all unilaterally connected components of a digraph |
scientific article; zbMATH DE number 3541933
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On finding all unilaterally connected components of a digraph |
scientific article; zbMATH DE number 3541933 |
Statements
On finding all unilaterally connected components of a digraph (English)
0 references
1976
0 references
