Computing the differential of a graph: hardness, approximability and exact algorithms (Q2448922)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6292090
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing the differential of a graph: hardness, approximability and exact algorithms |
scientific article; zbMATH DE number 6292090 |
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
0.7543825507164001
0 references
0.7112873196601868
0 references
0.7104292511940002
0 references
0.7054694294929504
0 references
0.7049100995063782
0 references
