Path: utzoo!mnetor!uunet!husc6!bloom-beacon!mit-eddie!uw-beaver!cornell!rochester!pt.cs.cmu.edu!andrew.cmu.edu!ds65+
From: ds65+@andrew.cmu.edu (Daniel Stodolsky)
Newsgroups: comp.misc
Subject: Applications for directed hamiltonian circuit finder
Message-ID: <QWUGh-y00Ugb03Lkp0@andrew.cmu.edu>
Date: 6 May 88 02:56:10 GMT
Organization: Carnegie Mellon
Lines: 17

The problem of determing wether a simple directed graph contains a hamiltonian
cycle is known to be NP-hard. Is there any applications, however, in which one
desired to know wether or not a directed graph is hamiltonian?

I would be indebted to anyone who could mail me a brief description of such
applications. Please do not post responses to this bboard, as I am not a
regular reader.

Thanks in advance,
                Daniel Stodolsky

Daniel Stodolsky
Design Research Center
Carnegie Mellon University

danner@edrc.cmu.edu
ds65@andrew.cmu.edu