|Looking for a rooted DAG isomorphism algorithm email@example.com (Charlie Burns) (1998-02-15)|
|Re: Looking for a rooted DAG isomorphism algorithm firstname.lastname@example.org (Carl Sturtivant) (1998-03-03)|
|Re: Looking for a rooted DAG isomorphism algorithm email@example.com (1998-03-05)|
|Re: Looking for a rooted DAG isomorphism algorithm firstname.lastname@example.org (Charlie Burns) (1998-03-06)|
|Re: Looking for a rooted DAG isomorphism algorithm karlcz@ISI.EDU (1998-03-12)|
|From:||Carl Sturtivant <email@example.com>|
|Date:||3 Mar 1998 10:39:58 -0500|
Charlie Burns wrote:
> 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
Could you be more precise?
Do you mean that each DAG has only one root, i.e. all other nodes have
non-zero indegree? And that this root is already distinguished in each
of the two DAGS whose isomorphism problem we are to solve?
Are the internal nodes (i.e. those nodes with non-zero outdegree)
Are the leaves (i.e. those nodes with zero outdegree) unlabeled?
Return to the
Search the comp.compilers archives again.