Déposez votre fichier ici pour le déplacer vers cet enregistrement.

The partially disjoint paths problem asks for paths $P_1, \ldots,P_k$ between given pairs of terminals, while certain pairs of paths $P_i$,$P_j$ are required to be disjoint. With the help of combinatorial group theory, we show that, for fixed $k$, this problem can be solved in polynomial time for planar directed graphs. We also discuss related problems. No specific foreknowledge is required.

05C10 ; 05C20 ; 05C25 ; 05C38 ; 68Q25 ; 90C27

Filtrer

Domaine
Codes MSC
Audience

Z
span> liste des Conferenciers
  • |
  • Domaines
  • |
  • Recherche
  • G

    F Nous contacter


    0

    Documents  05C38 | enregistrements trouvés : 1

    O
       

    -A +A

    P Q