On the complexity of the representation of simplicial complexes by trees (Q905846)
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 6536807
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of the representation of simplicial complexes by trees |
scientific article; zbMATH DE number 6536807 |
Statements
On the complexity of the representation of simplicial complexes by trees (English)
0 references
28 January 2016
0 references
simplicial complexes
0 references
hypergraphs
0 references
tree representations
0 references
NP-completeness
0 references
APX-completeness
0 references
approximation algorithms
0 references
0.7885251641273499
0 references
0.7852004766464233
0 references
0.7712135314941406
0 references
