Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time (Q4554938): Difference between revisions
From MaRDI portal
EloiFerrer (talk | contribs) Changed label, description and/or aliases in en, and other parts |
EloiFerrer (talk | contribs) Merged Item from Q5384006 |
||||||||||||||
| aliases / en / 0 | aliases / en / 0 | ||||||||||||||
Counting Thin Subgraphs via Packings Faster Than Meet-in-the-Middle Time | |||||||||||||||
| description / en | description / en | ||||||||||||||
scientific article; zbMATH DE number 7069363 | |||||||||||||||
| Property / title | |||||||||||||||
Counting Thin Subgraphs via Packings Faster Than Meet-in-the-Middle Time (English) | |||||||||||||||
| Property / title: Counting Thin Subgraphs via Packings Faster Than Meet-in-the-Middle Time (English) / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / zbMATH Open document ID | |||||||||||||||
| Property / zbMATH Open document ID: 1420.68155 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / DOI | |||||||||||||||
| Property / DOI: 10.1137/1.9781611973402.45 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / author | |||||||||||||||
| Property / author: Andreas Bjöurklund / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / published in | |||||||||||||||
| Property / published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / publication date | |||||||||||||||
20 June 2019
| |||||||||||||||
| Property / publication date: 20 June 2019 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / zbMATH DE Number | |||||||||||||||
| Property / zbMATH DE Number: 7069363 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / OpenAlex ID | |||||||||||||||
| Property / OpenAlex ID: W2104468092 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Latest revision as of 10:18, 6 May 2024
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
