Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time

DOI10.1145/3125500zbMath1452.68133arXiv1306.4111MaRDI QIDQ4554938

Andreas Björklund, Petteri Kaski, Łukasz Kowalik, 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

zbMATH Keywords

matrix multiplication; FPT algorithms; counting matchings; counting paths; meet in the middle; counting low pathwidth graphs; counting packings

Mathematics Subject Classification ID

68W40: Analysis of algorithms

68R10: Graph theory (including graph drawing) in computer science

05C30: Enumeration in graph theory

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C85: Graph algorithms (graph-theoretic aspects)