Problems remaining NP-complette for sparse or dense graphs (Q4846683)
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: Problems remaining NP-complette for sparse or dense graphs |
scientific article; zbMATH DE number 790718
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Problems remaining NP-complette for sparse or dense graphs |
scientific article; zbMATH DE number 790718 |
Statements
Problems remaining NP-complette for sparse or dense graphs (English)
0 references
8 November 1995
0 references
computational complexity
0 references
NP-completeness
0 references
Hamiltonian path
0 references
independent set
0 references
NP-complete
0 references
Hamiltonian circuit
0 references
0.7856037020683289
0 references
0.7767282128334045
0 references
0.7764426469802856
0 references
0.7697764039039612
0 references
