Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth (Q4554362)
From MaRDI portal
scientific article; zbMATH DE number 6979224
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth |
scientific article; zbMATH DE number 6979224 |
Statements
Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth (English)
0 references
13 November 2018
0 references
Gaussian elimination
0 references
treewidth
0 references
maximum matching
0 references
parameterized complexity
0 references
