Fully polynomial-time parameterized computations for graphs and matrices of low treewidth (Q4554362)
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 6979224
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9974947571754456
0 references
0.7946548461914062
0 references
0.7687909007072449
0 references
0.7656732201576233
0 references
0.7625636458396912
0 references
