Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!usc!isi.edu!vlsi-cad.isi.edu!pi
From: pi@quark.isi.edu (Jen-I Pi)
Newsgroups: comp.theory
Subject: References for hypergraph partition/covering/matching
Keywords: hypergraph, partition, covering, matching
Message-ID: <16706@venera.isi.edu>
Date: 10 Feb 91 07:47:55 GMT
References: <9102072218.AA03393@wh18.cps.msu.edu>
Sender: news@isi.edu
Reply-To: pi@vlsi-cad.isi.edu (Jen-I Pi)
Organization: USC/ISI (Information Science Institute)
Lines: 6

Does any one on the net know any reference for the discussion of
complexity for hypergraph partition/covering/matching problems?

Thnaks in advance!

Jen-I pi@vlsi-cad.isi.edu :-)