Problems remaining NP-complette for sparse or dense graphs (Q4846683): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.7151/dmgt.1004 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2054643041 / rank | |||
Normal rank | |||
Latest revision as of 00:46, 20 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
