Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

87

Voted

ISAAC
2009
Springer

102views Algorithms» more ISAAC 2009»

The Complexity of Perfect Matching Problems on Dense Hypergraphs

16 years 11 days ago

The Complexity of Perfect Matching Problems on Dense Hypergraphs

Download www.staff.amu.edu.pl

Marek Karpinski, Andrzej Rucinski, Edyta Szymanska

Real-time Traffic

Algorithms | ISAAC 2009 |

claim paper

Related Content

» Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs

» On Complexity and Approximability of the Labeled MaximumPerfect Matching Problems

» The Polynomially Bounded Perfect Matching Problem Is in NC 2

» A polynomial time equivalence between DNA sequencing and the exact perfect matching proble...

» Probabilistic graph and hypergraph matching

» On the complexity of approximating kset packing

» Santa Claus Meets Hypergraph Matchings

» On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Mat...

» Modelviewcontroller and object teams a perfect match of paradigms

Post Info
More Details (n/a)

Added	26 May 2010
Updated	26 May 2010
Type	Conference
Year	2009
Where	ISAAC
Authors	Marek Karpinski, Andrzej Rucinski, Edyta Szymanska

Comments (0)