Looking for a rooted DAG isomorphism algorithm

Charlie Burns <cburns@crl8.crl.com>
15 Feb 1998 21:34:21 -0500

From comp.compilers

Related articles
*Looking for a rooted DAG isomorphism algorithm cburns@crl8.crl.com (Charlie Burns)* (1998-02-15)**
Re: Looking for a rooted DAG isomorphism algorithm carl@bitstream.net (Carl Sturtivant) (1998-03-03)
Re: Looking for a rooted DAG isomorphism algorithm lkaplan@mips.complang.tuwien.ac.at (1998-03-05)
Re: Looking for a rooted DAG isomorphism algorithm cburns@crl2.crl.com (Charlie Burns) (1998-03-06)
Re: Looking for a rooted DAG isomorphism algorithm karlcz@ISI.EDU (1998-03-12)

| List of all articles for this month |

From:	Charlie Burns <cburns@crl8.crl.com>
Newsgroups:	comp.compilers
Date:	15 Feb 1998 21:34:21 -0500
Organization:	CRL Dialup Internet Access (415) 705-6060 [Login: guest]
Keywords:	analysis, question

I am looking for references to a rooted DAG isomorphism algorithm. The
DAGs I want to compare are like trees but nodes can have more than one
parent.

Thanks,

Charlie Burns
cburns@crl.com
--

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.