The edge Hamiltonian path problem is NP-complete for bipartite graphs (Q1210313)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 178053
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The edge Hamiltonian path problem is NP-complete for bipartite graphs |
scientific article; zbMATH DE number 178053 |
Statements
The edge Hamiltonian path problem is NP-complete for bipartite graphs (English)
0 references
23 May 1993
0 references
edge graph
0 references
computational complexity
0 references
edge Hamiltonian path problem
0 references
NP- complete
0 references
bipartite graphs
0 references
0.8311851024627686
0 references
0.8261041045188904
0 references
0.8095895648002625
0 references
0.8045974969863892
0 references
