From: hidders@REMOVE.THIS.win.tue.nl (Jan Hidders)
Newsgroups: comp.databases.theory
Subject: Re: finding 'mimimal' SQL statements
Followup-To: comp.databases.theory
Date: 27 Dec 2000 14:04:12 GMT
Organization: Eindhoven University of Technology
Lines: 10
Message-ID: <92csss$9ql$1@news.tue.nl>
References: <928fel$2e8u4$1@reader1.wxs.nl>
Reply-To: hidders@win.tue.nl (Jan Hidders)
NNTP-Posting-Host: wsinis12.win.tue.nl
X-Newsreader: trn 4.0-test74 (May 26, 2000)
Originator: hidders@win.tue.nl (Jan Hidders)


Marc Biemond wrote:
> During my work as an IT engineer I came across the following problem. In
> order to generate 'minimal' SQL statements, I need to find all spanning
> trees of a subset of vertices in an undirected graph.

First find a spanning tree on the complete graph, then keep removing the leaf
vertices not in the subset until there are no more.

-- 
  Jan Hidders