Oracle FAQ Your Portal to the Oracle Knowledge Grid
HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US
 

Home -> Community -> Usenet -> comp.databases.theory -> Re: finding 'mimimal' SQL statements

Re: finding 'mimimal' SQL statements

From: Jan Hidders <hidders_at_REMOVE.THIS.win.tue.nl>
Date: 27 Dec 2000 14:04:12 GMT
Message-ID: <92csss$9ql$1@news.tue.nl>

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
Received on Wed Dec 27 2000 - 08:04:12 CST

Original text of this message

HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US