[UAI] Triangulated Subgraph

From: Roberto Santana (rsantana@cidet.icmf.inf.cu)
Date: Sun May 21 2000 - 23:16:30 PDT

Next message: Nello Cristianini: "[UAI] NeuroCOLT workshop on Reinforcement Learning"

Previous message: Russell Almond: "Re: [UAI] Adaptive questionnaires using bayesian networks"
Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

Hello,

I am looking for references to an algorithm to find a triangulated
subgraph G'=(V',E') on an undirected graph G = (V,E) such that | E - E'|
is minimum.
In a more general case edges are weighted, and the task is to find a
decomposable subgraph of G by means of removing from G that set of edges
such that the sum of its edges' weights is minimum.
Thanks in advance for your help.

Roberto Santana

Roberto Santana
-------------------------------------------------
Institute of Cybernetics, Mathematics and Physics
Havana, Cuba

Next message: Nello Cristianini: "[UAI] NeuroCOLT workshop on Reinforcement Learning"
Previous message: Russell Almond: "Re: [UAI] Adaptive questionnaires using bayesian networks"
Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

This archive was generated by hypermail 2b29 : Sun May 21 2000 - 23:25:14 PDT