On space efficiency of algorithms working on structural decompositions of graphs (Q4601909)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On space efficiency of algorithms working on structural decompositions of graphs |
scientific article; zbMATH DE number 6829398
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On space efficiency of algorithms working on structural decompositions of graphs |
scientific article; zbMATH DE number 6829398 |
Statements
24 January 2018
0 references
tree decomposition
0 references
LCS
0 references
tree-depth
0 references
NAuxSA
0 references
Savitch's theorem
0 references
On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs. (English)
0 references
0.9975053071975708
0 references
0.8019482493400574
0 references
0.8014890551567078
0 references
0.7999303936958313
0 references
0.7790967226028442
0 references
