Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| 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) |
| From: | Charlie Burns <cburns@crl2.crl.com> |
| Newsgroups: | comp.compilers |
| Date: | 6 Mar 1998 16:55:21 -0500 |
| Organization: | CRL Dialup Internet Access (415) 705-6060 [Login: guest] |
| References: | 98-02-073 98-03-008 |
| Keywords: | theory |
The dags in question have a single, known root.
The internal nodes, leaves, and root are labled. I am looking for a
mapping between nodes of the dags once they are determined to be
isomorphic.
A unique signature for each (unique) dag would useful too.
Sorry for being vague.
Thanks,
Charlie
> > 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.
Carl Sturtivant <carl@bitstream.net> wrote:
> Could you be more precise?
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.