grap algorithms

Thread View: comp.lang.functional

1 messages

[T] Back to Threads [V] Tree View [G] Group Articles

1 total messages Started by Radu Grosu Mon, 07 Sep 1992 15:11

#132

Author: 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

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads