Article View: comp.theory
Article #1843Question
From: Zafar U. Singhera
Date: Thu, 27 Jun 1991 06:04
Date: Thu, 27 Jun 1991 06:04
5 lines
621 bytes
621 bytes
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.
Technical Details
Message-ID:
<18058@chaph.usc.edu>Path:
arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!usc!chaph.usc.edu!aludra.usc.edu!zsingherShow Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!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