Fully polynomial-time algorithms parameterized by vertex integrity using fast matrix multiplication (Q6656956)
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: Fully polynomial-time algorithms parameterized by vertex integrity using fast matrix multiplication |
scientific article; zbMATH DE number 7961861
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fully polynomial-time algorithms parameterized by vertex integrity using fast matrix multiplication |
scientific article; zbMATH DE number 7961861 |
Statements
Fully polynomial-time algorithms parameterized by vertex integrity using fast matrix multiplication (English)
0 references
6 January 2025
0 references
FPT in P
0 references
algebraic algorithms
0 references
adaptive algorithms
0 references
subgraph detection
0 references
matching
0 references
APSP
0 references
