Problems remaining NP-complette for sparse or dense graphs (Q4846683): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 17:40, 5 March 2024
scientific article; zbMATH DE number 790718
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
