Hardness and Algorithms for Rainbow Connectivity (Q5389981): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| label / en | label / en | ||
Hardness and Algorithms for Rainbow Connectivity | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2282096084 / rank | |||
Normal rank | |||
| Property / title | |||
Hardness and Algorithms for Rainbow Connectivity (English) | |||
| Property / title: Hardness and Algorithms for Rainbow Connectivity (English) / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:08, 30 July 2024
scientific article; zbMATH DE number 6027220
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness and Algorithms for Rainbow Connectivity |
scientific article; zbMATH DE number 6027220 |
Statements
24 April 2012
0 references
rainbow connectivity
0 references
NP-hardness
0 references
NP-completeness
0 references
combinatorial problem
0 references
Hardness and Algorithms for Rainbow Connectivity (English)
0 references
