Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!usc!chaph.usc.edu!aludra.usc.edu!zsingher
From: singhera@aludra.usc.edu (Zafar U. Singhera)
Newsgroups: comp.theory
Subject: Question
Message-ID: <18058@chaph.usc.edu>
Date: 27 Jun 91 06:04:47 GMT
Sender: news@chaph.usc.edu
Organization: University of Southern California, Los Angeles, CA
Lines: 5
Nntp-Posting-Host: aludra.usc.edu
Originator: zsingher@aludra.usc.edu


Would someone be kind enough to point out any refrences on the upper and lower 
bounds for the Minimum Node(Edge) Deletion Bipartite Sub-graph Problem. 

Thanks in advance.