[UAI] hypergraph separators

From: as as (lien_david@yahoo.com)
Date: Tue Mar 12 2002 - 10:09:41 PST

Next message: Russell Almond: "[UAI] Looking for Survey of Learning Bayesian Networks"

Previous message: Peter Lucas: "[UAI] Last CfP: Intelligent Data Analysis in Biomedicine - IDAMAP 2002"
Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

Hello,

I am looking for an algorithm for the folowing
problems.

1. Given H=[h_1,h_2,...,h_n} as a hypergraph
I want to identify all the separators s of
H.

2. Given H=[h_1,h_2,...,h_n} as a hypergraph
I want to identify all the separators s of
H such that s is a subset of h_i, 1<=i<=n.

Is anyone here aware of this kind of algorithm?

THanks a lot,
David

__________________________________________________
Do You Yahoo!?
Try FREE Yahoo! Mail - the world's greatest free email!
http://mail.yahoo.com/

Next message: Russell Almond: "[UAI] Looking for Survey of Learning Bayesian Networks"
Previous message: Peter Lucas: "[UAI] Last CfP: Intelligent Data Analysis in Biomedicine - IDAMAP 2002"
Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

This archive was generated by hypermail 2b29 : Tue Mar 12 2002 - 10:16:31 PST