home *** CD-ROM | disk | FTP | other *** search
/ NetNews Usenet Archive 1992 #19 / NN_1992_19.iso / spool / comp / theory / 1844 < prev    next >
Encoding:
Internet Message Format  |  1992-08-31  |  981 b 
  1. Path: sparky!uunet!gatech!destroyer!gumby!yale!yale.edu!jvnc.net!netnews.upenn.edu!netnews.cc.lehigh.edu!lafibm.lafayette.edu
  2. From: MT30@lafibm.lafayette.edu (T'seliso Mosiuoa)
  3. Newsgroups: comp.theory
  4. Subject: Recent Results in the theory of NP-Completeness
  5. Message-ID: <31AUG92.09864411.0068@lafibm.lafayette.edu>
  6. Date: 31 Aug 92 14:08:01 GMT
  7. Sender: usenet@lafibm.lafayette.edu
  8. Organization: Lafayette College
  9. Lines: 12
  10. Originator: news@lafcol
  11. Nntp-Posting-Host: lafibm
  12.  
  13. I am currently working on a thesis that will somehow involve
  14. NP-Complete Graph problems.  I would be very grateful if someone
  15. out there would provide me with a list of references for the
  16. recent developments in the field.  David S. Johnson used to
  17. run a column in the Journal Of Algorithms, I was able to follow
  18. that up until 1988. I would be happy also if someone out there
  19. knew David Johnson's email address.
  20. Thank you very much.
  21.  
  22. Tseliso Mosiuoa
  23. (Mosiuoat@lafvax.lafayette.edu)
  24. (mt30@lafibm.lafayette.edu)
  25.