[UAI] Cutset in directed graph

From: Wagner Teixeira da Silva (wagner@cic.unb.br)
Date: Mon Feb 25 2002 - 09:28:31 PST

Next message: Wagner Teixeira da Silva: "[UAI] (A,B|C) - find a minimal C that desconnect A and B in G(V,E)."

Previous message: Lorenzo Van Wijk: "[UAI] Need a little bit of your help [dynamic belief networks based on belief functions]"
Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

Dear colleagues:

I am interested in algorithms that find the minimum 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.=20
http://www.cic.unb.br/docentes/wagner

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

This archive was generated by hypermail 2b29 : Mon Feb 25 2002 - 09:33:53 PST