Computing the differential of a graph: hardness, approximability and exact algorithms (Q2448922): 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.1016/j.dam.2012.11.013 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2040446810 / rank | |||
Normal rank | |||
Revision as of 00:51, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the differential of a graph: hardness, approximability and exact algorithms |
scientific article |
Statements
Computing the differential of a graph: hardness, approximability and exact algorithms (English)
0 references
5 May 2014
0 references
differential of a graph
0 references
computational complexity
0 references
algorithms for NP hard problems
0 references
