On Counting Parameterized Matching and Packing

DOI10.1007/978-3-319-39817-4_13zbMath1475.68248OpenAlexW2493989425MaRDI QIDQ4632178

Yunlong Liu, Jianxin Wang

Publication date: 26 April 2019

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-39817-4_13

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Randomized algorithms (68W20) Parameterized complexity, tractability and kernelization (68Q27)

Cites Work

• Unnamed Item
• Unnamed Item
• The challenges of unbounded treewidth in parameterised subgraph counting problems
• On counting 3-D matchings of size \(k\)
• The parameterised complexity of counting connected subgraphs and graph motifs
• Parameterized counting problems
• Exact Parameterized Multilinear Monomial Counting via k-Layer Subset Convolution and k-Disjoint Sum
• Limits and Applications of Group Algebras for Parameterized Problems
• Counting Paths and Packings in Halves
• Monte-Carlo approximation algorithms for enumeration problems
• The Parameterized Complexity of Counting Problems
• Parameterized and Exact Computation
• Counting Matchings of Size k Is $\sharp$ W[1-Hard]

This page was built for publication: On Counting Parameterized Matching and Packing