An \(O(n+m)\) certifying triconnnectivity algorithm for Hamiltonian graphs (Q2429326): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:20, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(n+m)\) certifying triconnnectivity algorithm for Hamiltonian graphs |
scientific article |
Statements
An \(O(n+m)\) certifying triconnnectivity algorithm for Hamiltonian graphs (English)
0 references
26 April 2012
0 references
graph algorithms
0 references
certifying algorithms
0 references
triconnectivity
0 references
Hamiltonian graph
0 references
