Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!usc!cs.utexas.edu!ut-emx!bongo.cc.utexas.edu!condor
From: condor@bongo.cc.utexas.edu (Georgios Kontoravdis)
Newsgroups: comp.theory
Subject: Dominating Set of Circle Graph
Keywords: Dominating Set, Circle Graph
Message-ID: <46866@ut-emx.uucp>
Date: 8 Apr 91 18:31:41 GMT
Sender: news@ut-emx.uucp
Reply-To: condor@bongo.cc.utexas.edu (Georgios Kontoravdis)
Organization: The University of Texas at Austin; Austin, Texas
Lines: 7
Originator: condor@bongo.cc.utexas.edu



   Does anyone know if the minimum dominating set problem can be solved
in polynomial time for circle graphs?

:Georgios Kontoravdis
 condor@bongo.cc.utexas.edu