Vertex partitioning of a class of digraphs
A vertex subset V' of a digraph is a pseudo sink set if its out-degree is low. The research of a pseudo sink set in a digraph is a high complexity combinatory problem. We show, for a particular family of digraphs, that a clustering of the vertex set fitted with a well chosen metric allows to re...
Enregistré dans:
| Dans: | URI:https://journals.openedition.org/msh, |
|---|---|
| Auteurs principaux: | , |
| Format: | Article ou chapitre numérique |
| Langue: | Anglais |
| Publié: |
Mathématiques et sciences humaines
2006
|
| Sujets: | |
| Accès en ligne: | Accès Université d'Orléans et IFPM Accès Université d'Orléans et IFPM |