Strong connectivity in symmetric graphs and generation of maximal minimally strongly connected subgraphs (Q754894)
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: Strong connectivity in symmetric graphs and generation of maximal minimally strongly connected subgraphs |
scientific article; zbMATH DE number 3648748
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strong connectivity in symmetric graphs and generation of maximal minimally strongly connected subgraphs |
scientific article; zbMATH DE number 3648748 |
Statements
Strong connectivity in symmetric graphs and generation of maximal minimally strongly connected subgraphs (English)
0 references
1978
0 references
strong connectivity
0 references
minimally strongly connected
0 references
maximal minimally strongly connected
0 references
subgraphs
0 references
algorithm
0 references
symmetric graph
0 references
