Finding a Minimum Equivalent Graph of a Digraph
Posted
by kohlerm
on Stack Overflow
See other posts from Stack Overflow
or by kohlerm
Published on 2010-03-15T15:14:13Z
Indexed on
2010/03/16
11:46 UTC
Read the original article
Hit count: 347
I'm looking for an implementation preferably in Java of an algorithm for finding a Minimum Equivalent Graph of a Digraph (http://portal.acm.org/citation.cfm?id=321526.321534).
Even better would be an implementation of "Approximating the minimum equivalent digraph" http://cat.inist.fr/?aModele=afficheN&cpsidt=3634076 (requires ACM membership, sorry) alternative link http://www.cs.umd.edu/~samir/grant/kry94b.ps (postscript)
© Stack Overflow or respective owner