Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!swrinde!zaphod.mps.ohio-state.edu!samsung!uunet!mcsun!hp4nl!svin02!eba!al.ele.tue.nl!euteal!wim
From: wim@es.ele.tue.nl (Wim Philipsen)
Newsgroups: comp.theory
Subject: clique covering
Message-ID: <WIM.90Sep14082706@eutes4.es.ele.tue.nl>
Date: 14 Sep 90 06:27:06 GMT
Sender: news@eba.eb.ele.tue.nl (The News system)
Distribution: comp
Organization: Eindhoven University of Technology, Eindhoven, The Netherlands
Lines: 12


I am looking for an algorithm to perform a maximum weighted clique covering of
a graph.

Any pointers?

--
__
Wim J. M. Philipsen                         | Phone: +(31)40-473345
Eindhoven University of Technology, Dept. of Electr. Eng. (ES/EH 7.23)
P.O. Box 513, 5600 MB Eindhoven, The Netherlands
Email: wim@es.ele.tue.nl