|Looking for a rooted DAG isomorphism algorithm firstname.lastname@example.org (Charlie Burns) (1998-02-15)|
|Re: Looking for a rooted DAG isomorphism algorithm email@example.com (Carl Sturtivant) (1998-03-03)|
|Re: Looking for a rooted DAG isomorphism algorithm firstname.lastname@example.org (1998-03-05)|
|Re: Looking for a rooted DAG isomorphism algorithm email@example.com (Charlie Burns) (1998-03-06)|
|Re: Looking for a rooted DAG isomorphism algorithm karlcz@ISI.EDU (1998-03-12)|
|From:||Charlie Burns <firstname.lastname@example.org>|
|Date:||6 Mar 1998 16:55:21 -0500|
|Organization:||CRL Dialup Internet Access (415) 705-6060 [Login: guest]|
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
A unique signature for each (unique) dag would useful too.
Sorry for being vague.
> > 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 <email@example.com> wrote:
> Could you be more precise?
Return to the
Search the comp.compilers archives again.