5 Mar 1998 23:20:33 -0500

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: | lkaplan@mips.complang.tuwien.ac.at (Aaron Leon Kaplan) |

Newsgroups: | comp.compilers |

Date: | 5 Mar 1998 23:20:33 -0500 |

Organization: | Vienna University of Technology, Austria |

References: | 98-02-073 |

Keywords: | theory |

Charlie Burns (cburns@crl8.crl.com) 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*

*: parent.*

Hmmm... the only thing I can think of is the isomorphism algorithm

in Aho, Hopcroft, Ullman, "The Design and Analysis of Computer Algorithms".

I am not sure however if it is only for trees, anyway, I remember that it

runs in O(n) :-)

cu,

Aaron.

--

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.