Article View: comp.theory
Article #1742N-MATCHING INFO WANTED !
From: MIKA JOHNSSON
Date: Fri, 18 Dec 1992 16:12
Date: Fri, 18 Dec 1992 16:12
12 lines
829 bytes
829 bytes
HI EVERYONE ! I'm interested in 3-matching or n-Matching with n > 2 If anyone knows any articles, books, etc. that deals with n-Matching algorithms (heuristical or optimal) and their complexity, could you please inform me, Thanks in advance Mika Johnsson e-mail johnsson@sara.cc.utu.fi Univerity of Turku, Finland
Technical Details
Message-ID:
<1992Dec18.140758.1@sara.cc.utu.fi>Path:
arc1-ca.pugleaf.net!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!johnssonShow Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!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 From: johnsson@sara.cc.utu.fi (MIKA JOHNSSON) Newsgroups: comp.theory Subject: N-MATCHING INFO WANTED ! Message-ID: <1992Dec18.140758.1@sara.cc.utu.fi> Date: 18 Dec 92 16:12:51 GMT Sender: news@polaris.utu.fi (Usenet News admin) Organization: University of Turku, Finland Lines: 12