grap algorithms

Article View: comp.lang.functional

Article #132

Back to comp.lang.functional Previous Next

#132

From: Radu Grosu
Date: Mon, 07 Sep 1992 15:11

44 lines
1654 bytes

Here is my summary of responses on graph problems formulated as the fixed point
of a set of recursive equations. 

It seems that only one paper treated this issue. 

Below you find the responses I received. Thanks to anyone who replied.


Radu Grosu
Institut fuer Informatik
Technische Universitaet Muenchen
Arcisstrasse 21
D-8000 Muenchen 2
Germany


------------------------------------------------------------
   From:   martin.erwig@feruni-hagen.de (Martin Erwig)
------------------------------------------------------------

Have a look at:

  Kashiwagi, Y., Wise,D.S.: Graph Algorithms in a Lazy
  Functional Programming Language, Proc. 4th Int. Symp. on Lucid
  and Intensional Programming, 1991, 35--46.



-------------------------------------------------------------
   From:	jq@minster.york.ac.uk
-------------------------------------------------------------

Have you tried:

Graph Algorithms in a lazy functional programming language
Yugo Kashiwagi
David S. Wise
April 1991
Technical report no 330
Computer Science department Indiana Universiy
Bloomington Indiana 47405-4101

John

Technical Details

Message-ID: <1992Sep7.151128.20817@Informatik.TU-Muenchen.DE>

Path: arc1-ca.pugleaf.net!sparky!uunet!mcsun!Germany.EU.net!math.fu-berlin.de!informatik.tu-muenchen.de!grosu

Show Full Headers

Complete Article Headers

Newsgroups: comp.lang.functional
Path: arc1-ca.pugleaf.net!sparky!uunet!mcsun!Germany.EU.net!math.fu-berlin.de!informatik.tu-muenchen.de!grosu
From: grosu@Informatik.TU-Muenchen.DE (Radu Grosu)
Subject: grap algorithms
Keywords: graphs, fixpoint
Originator: grosu@sunbroy24.informatik.tu-muenchen.de
Sender: news@Informatik.TU-Muenchen.DE (USENET Newssystem)
Organization: Technische Universitaet Muenchen, Germany
Date: Mon, 7 Sep 1992 15:11:28 GMT
Message-ID: <1992Sep7.151128.20817@Informatik.TU-Muenchen.DE>
Lines: 44