Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth (Q4554362): Difference between revisions
From MaRDI portal
Changed an Item |
Created claim: Wikidata QID (P12): Q129724156, #quickstatements; #temporary_batch_1733743725753 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q129724156 / rank | |||
Normal rank | |||
Latest revision as of 12:31, 9 December 2024
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
