Strong connectivity in symmetric graphs and generation of maximal minimally strongly connected subgraphs (Q754894): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1144375 |
Changed an Item |
||
| Property / author | |||
| Property / author: Sunil R. Das / rank | |||
Normal rank | |||
Revision as of 10:54, 22 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Strong connectivity in symmetric graphs and generation of maximal minimally strongly connected subgraphs |
scientific article |
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
