[UAI] question!!! [I'm looking for an algorithm ...]

From: Linda Smail (lsmail@etudiant.univ-mlv.fr)
Date: Tue Jun 18 2002 - 09:36:38 PDT

  • Next message: Shie Mannor: "[UAI] CfP: AOR special issue - Cross-Entropy Method"

    Hello,
    I'm looking for an algorithm for the folowing problem :
    given (I, G ) an acyclique graphe,
    given J subset of I
    I want to identify all vertex from J, which are :
    1) connect by direct connection
    or
    2) connected by chains such that for all vertex i by which it passes, we have :
    a) chains convergent towards i if the vertex i is in J
    b) chains in series if the vertex i is not in J.
    is anyone here aware this kind of algorithm?
    Thanks for your help.
    Lynda

    This archive was generated by hypermail 2b29 : Tue Jun 18 2002 - 09:38:15 PDT