Why Depth-First Search Efficiently Identifies Two and Three-Connected Graphs (Q3060789)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Why Depth-First Search Efficiently Identifies Two and Three-Connected Graphs |
scientific article |
Statements
Why Depth-First Search Efficiently Identifies Two and Three-Connected Graphs (English)
0 references
9 December 2010
0 references
