Counting thin subgraphs via packings faster than meet-in-the-middle time (Q6829485)
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 6976493
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting thin subgraphs via packings faster than meet-in-the-middle time |
scientific article; zbMATH DE number 6976493 |
Statements
Counting thin subgraphs via packings faster than meet-in-the-middle time (English)
0 references
12 November 2018
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
