On counting 3-D matchings of size \(k\)
From MaRDI portal
Publication:1040648
DOI10.1007/s00453-008-9207-xzbMath1185.68364MaRDI QIDQ1040648
Jianxin Wang, Yunlong Liu, Jian'er Chen
Publication date: 25 November 2009
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-008-9207-x
approximation algorithm; randomized algorithm; counting complexity; parameterized algorithm; 3-D matching
68Q25: Analysis of algorithms and problem complexity
05A16: Asymptotic enumeration
68W25: Approximation algorithms
68W20: Randomized algorithms