Computing the differential of a graph: hardness, approximability and exact algorithms (Q2448922)
From MaRDI portal
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
0 references
