Sciweavers

ISAAC
2009
Springer

The Complexity of Perfect Matching Problems on Dense Hypergraphs

14 years 6 months ago
The Complexity of Perfect Matching Problems on Dense Hypergraphs
Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
Added 26 May 2010
Updated 26 May 2010
Type Conference
Year 2009
Where ISAAC
Authors Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
Comments (0)