Strong connectivity in symmetric graphs and generation of maximal minimally strongly connected subgraphs (Q754894): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Sequential Algorithm for the Determination of Maximum Compatibles / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On a New Approach for Finding All the Modified Cut-Sets in an Incompatibility Graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Analysis of Graphs by Connectivity Considerations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Boolean Algebra, Map Coloring, and Interconnections / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3285875 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel concepts in graph theory / rank | |||
Normal rank | |||
Latest revision as of 02:17, 13 June 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
