Intersecting graphs...

["Halvar Flake" <HalVar () gmx de>]

Hey all,

it might sound odd that I am asking a graph-theory question here,
but with DD being a list full of smart people with odd hobbies I
thought I might find an answer here:

Does anyone know of a reasonably fast algorithm which calculates
the intersection of two acyclic digraphs with a common "root"-node ?

Cheers,
Halvar

-- 
GMX ProMail mit bestem Virenschutz http://www.gmx.net/de/go/mail
+++ Empfehlung der Redaktion +++ Internet Professionell 10/04 +++

_______________________________________________
Dailydave mailing list
Dailydave () lists immunitysec com
http://www.immunitysec.com/mailman/listinfo/dailydave