Fully polynomial-time parameterized computations for graphs and matrices of low treewidth (Q4575835): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:13, 7 February 2024
scientific article; zbMATH DE number 6904120
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fully polynomial-time parameterized computations for graphs and matrices of low treewidth |
scientific article; zbMATH DE number 6904120 |
Statements
Fully polynomial-time parameterized computations for graphs and matrices of low treewidth (English)
0 references
16 July 2018
0 references
