Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time (Q4554938)
From MaRDI portal
scientific article; zbMATH DE number 7069363
- Counting Thin Subgraphs via Packings Faster Than Meet-in-the-Middle Time
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time |
scientific article; zbMATH DE number 7069363 |
|
Statements
Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time (English)
0 references
Counting Thin Subgraphs via Packings Faster Than Meet-in-the-Middle Time (English)
0 references
12 November 2018
0 references
20 June 2019
0 references
FPT algorithms
0 references
counting low pathwidth graphs
0 references
counting matchings
0 references
counting packings
0 references
counting paths
0 references
matrix multiplication
0 references
meet in the middle
0 references
