Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sdd.hp.com!wuarchive!uunet!mcsun!ukc!mucs!m1!michael From: michael@cs.man.ac.uk (Michael Fisher) Newsgroups: comp.theory Subject: Connected components of AND/OR graphs Message-ID: Date: 5 Oct 90 12:38:38 GMT Sender: news@cs.man.ac.uk Distribution: comp.theory Organization: Department of Computer Science, University of Manchester Lines: 24 Does anyone the complexity of searching for strongly connected components of AND/OR graphs? Better still, does anyone know of an algorithm for doing this? Michael --------------------------------------------------------------------- | Michael Fisher, Tel: (+44) 61-275 6139 | | Department of Computer Science, Internal: 6139 | | University of Manchester, | | Oxford Road, Manchester, JANET: michael@uk.ac.man.cs | | M13 9PL UUCP: ...ukc!man.cs!michael | | U.K. ARPA: michael%cs.man.ac.uk@nsfnet-relay.ac.uk | --------------------------------------------------------------------- -- --------------------------------------------------------------------- | Michael Fisher, Tel: (+44) 61-275 6139 | | Department of Computer Science, Internal: 6139 | | University of Manchester, | | Oxford Road, Manchester, JANET: michael@uk.ac.man.cs | | M13 9PL UUCP: ...ukc!man.cs!michael | | U.K. ARPA: michael%cs.man.ac.uk@nsfnet-relay.ac.uk | ---------------------------------------------------------------------