home *** CD-ROM | disk | FTP | other *** search
/ NetNews Usenet Archive 1992 #30 / NN_1992_30.iso / spool / comp / theory / 2733 < prev    next >
Encoding:
Internet Message Format  |  1992-12-21  |  807 b 
  1. Path: sparky!uunet!zaphod.mps.ohio-state.edu!rphroy!caen!malgudi.oar.net!news.ans.net!europa.asd.contel.com!paladin.american.edu!news.univie.ac.at!hp4at!mcsun!news.funet.fi!polaris!sara.cc.utu.fi!johnsson
  2. From: johnsson@sara.cc.utu.fi (MIKA JOHNSSON)
  3. Newsgroups: comp.theory
  4. Subject: N-MATCHING INFO WANTED !
  5. Message-ID: <1992Dec18.140758.1@sara.cc.utu.fi>
  6. Date: 18 Dec 92 16:12:51 GMT
  7. Sender: news@polaris.utu.fi (Usenet News admin)
  8. Organization: University of Turku, Finland
  9. Lines: 12
  10.  
  11. HI EVERYONE !
  12.  
  13. I'm interested in 3-matching or n-Matching with n > 2
  14.  
  15. If anyone knows any articles, books, etc. that deals with n-Matching algorithms
  16. (heuristical or optimal) and their complexity, could you please inform me,
  17.  
  18. Thanks in advance
  19.  
  20. Mika Johnsson
  21. e-mail johnsson@sara.cc.utu.fi
  22. Univerity of Turku, Finland 
  23.