Path: utzoo!mnetor!uunet!husc6!ncar!ames!sri-spam!sri-unix!quintus!ok
From: ok@quintus.UUCP (Richard A. O'Keefe)
Newsgroups: comp.lang.prolog
Subject: Re: Another embarassingly simple problem
Message-ID: <823@cresswell.quintus.UUCP>
Date: 26 Mar 88 06:58:22 GMT
References: <489@dcl-csvax.comp.lancs.ac.uk>
Distribution: comp.lang.prolog
Organization: Quintus Computer Systems, Mountain View, CA
Lines: 4
Keywords: Prolog, database, graph

In article <489@dcl-csvax.comp.lancs.ac.uk>,
simon@comp.lancs.ac.uk (Simon Brooke) writes about finding "best joins".

Isn't the matrix chain problem a special case of this?