🚀 go-pugleaf

Hi,

I am interested in practical approaches to the implementation
of tricky, sophisticated graph algorithms, and I am looking
for experiences with respect to robustness, practical efficiency,
reusability, and flexibility.  In particular,

  * What is known about LEDA?  Is there any work about how LEDA
    based implementations compare to implementations ``from scratch''?
    The FAQ file refers to some work done by Ulrich Lauther.
    Where can I get a copy?

  * Are there further libraries supporting implementations of
    graph algorithms?  Is there any work on comparisons of
    libraries?  What about libraries written in languages
    different from C++?  I know Karla (written in Sather),
    and I remember the names GraphEd and Edge.  Where can I
    get more information about the latter two libraries?

  * What about non-library approaches?  By this I mean, for example,
    implementations of algorithms based on taxonomies.  I know the
    work by B. Watson on pattern matching and the work by Gallo
    and Scutella on maximum flows.  Are there further non-library
    approaches?

  * Are there other related news groups (I know comp.theory)?

  * Are there survey papers?
  
Any hint is appreciated.
Thanks in advance,

Karsten Weihe

--

  Uni Konstanz     |  Phone: ++49-7531-88-4375
  Informatik       |  Fax:   ++49-7531-883577
  78434 Konstanz   |  Email: karsten.weihe@uni-konstanz.de
  Germany          |  WWW:   http://www.informatik.uni-konstanz.de/~weihe