Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sun-barr!apple!bionet!ames!sparkyfs.erg.sri.com!vlad
From: vlad@erg.sri.com (beyer)
Newsgroups: comp.theory
Subject: Re: References for hypergraph partition/covering/matching
Keywords: hypergraph, partition, covering, matching
Message-ID: <1991Feb11.215802.28518@erg.sri.com>
Date: 11 Feb 91 21:58:02 GMT
References: <9102072218.AA03393@wh18.cps.msu.edu> <16706@venera.isi.edu>
Sender: news@erg.sri.com
Organization: SRI International, Menlo Park, CA
Lines: 25

In article <16706@venera.isi.edu> pi@vlsi-cad.isi.edu (Jen-I Pi) writes:
>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 :-)



I did a number of things on graph and hypergraph partitioning in my thesis
in 1986, most published, some still in my notes.

If you tell me what problems exactly you are interested in, I can tell
you what I know about them.

One particular paper of mine:

``Complexity of Generalized Graph Coloring,'' Proc. 12th International
Symposium on Mathematical Foundations of Computer Science,
 Lecture Notes in Computer Science 233, J. Gruska et al., eds,
Springer-Verlag, Aug. 1986.


Vlad