Sciweavers

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

32

Voted

COMBINATORICA
2002

favoriteEmaildiscussreport

58views more COMBINATORICA 2002»

Perfect Matchings in Balanced Hypergraphs - A Combinatorial Approach

14 years 9 months ago

Perfect Matchings in Balanced Hypergraphs - A Combinatorial Approach

Download atos.wmid.amu.edu.pl

Andreas Huck, Eberhard Triesch

Real-time Traffic

COMBINATORICA 2002 |

claim paper

Related Content

» SDPBased Algorithms for Maximum Independent Set Problems on Hypergraphs

» Perfect matchings with restricted intersection in cubic graphs

» Santa Claus Meets Hypergraph Matchings

» ManytoMany Graph Matching a Continuous Relaxation Approach

» A Statistical Matching Approach to Detect Privacy Violation for TrustBased Collaborations

» Minimizing the stabbing number of matchings trees and triangulations

» Size Bounds and Query Plans for Relational Joins

» Eliminating graphs by means of parallel knockout schemes

» Counting Subgraphs via Homomorphisms

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2002
Where	COMBINATORICA
Authors	Andreas Huck, Eberhard Triesch

Comments (0)