Publication:4554938: Difference between revisions
Created automatically from import240129110113 |
EloiFerrer (talk | contribs) m EloiFerrer moved page Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time to Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time: Duplicate |
(No difference)
|
Latest revision as of 16:06, 2 May 2024
DOI10.1145/3125500zbMath1452.68133arXiv1306.4111OpenAlexW2963965405MaRDI QIDQ4554938
Łukasz Kowalik, Petteri Kaski, Andreas Björklund, Andreas Bjöurklund
Publication date: 12 November 2018
Published in: ACM Transactions on Algorithms, Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.4111
matrix multiplicationFPT algorithmscounting matchingscounting pathsmeet in the middlecounting low pathwidth graphscounting packings
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items