[UAI] (A,B|C) - find a minimal C that desconnect A and B in G(V,E).

• Previous message: Wagner Teixeira da Silva: "[UAI] Cutset in directed graph"
• Next in thread: Frank Jensen: "[UAI] (A,B|C) - find a minimal C that desconnect A and B in G(V,E)."
• Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

Dear colleagues:

Let G(V,E) is a non oriented graph; and A,B subset of V. I need find
C, a minimal subset of V, that when removed causes A and B to be
desconnected. I search for algorithms that find this kind of minimal
cut set in non directed graph, so we will be grateful if anyone can
suggest any references about it.

Thank you very much in advance.

 Wagner
Computer Science Department
Brasilia University, Brazil.
http://www.cic.unb.br/docentes/wagner

• Next message: Kayaalp, Mehmet: "RE: [UAI] Need a little bit of your help [dynamic belief networks based on belief functions]"
• Previous message: Wagner Teixeira da Silva: "[UAI] Cutset in directed graph"
• Next in thread: Frank Jensen: "[UAI] (A,B|C) - find a minimal C that desconnect A and B in G(V,E)."
• Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

This archive was generated by hypermail 2b29 : Mon Feb 25 2002 - 10:57:43 PST