A simple certifying algorithm for 3-edge-connectivity (Q2689444): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1062458 |
Changed an Item |
||
| Property / author | |||
| Property / author: Yung Hyang Tsin / rank | |||
Normal rank | |||
Revision as of 05:04, 22 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple certifying algorithm for 3-edge-connectivity |
scientific article |
Statements
A simple certifying algorithm for 3-edge-connectivity (English)
0 references
10 March 2023
0 references
certifying algorithm
0 references
graph recognition algorithm
0 references
3-edge-connected graph
0 references
3-edge-connected component
0 references
Mader construction sequence
0 references
cactus representation of cut-pair
0 references
certificate
0 references
depth-first search
0 references
