An \(O(n+m)\) certifying triconnnectivity algorithm for Hamiltonian graphs (Q2429326)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An O(n+m) certifying triconnnectivity algorithm for Hamiltonian graphs |
scientific article; zbMATH DE number 6028458
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(O(n+m)\) certifying triconnnectivity algorithm for Hamiltonian graphs |
scientific article; zbMATH DE number 6028458 |
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
0 references
0.7859506607055664
0 references
0.7746850252151489
0 references
0.7538611888885498
0 references
