Several Classical Graph Problems Revisited With Tokens
Quelques problèmes de graphes avec jetons
Résumé
In graph theory, any vertex of a graph has a given set of incident edges and neighbors. All these objects (vertices and edges) are available and can be used to produce a solution to any graph problem. In this note we explore another model: a vertex only has a limited number of its incident edges or neighbors that can be used. This restricted capability is modeled by tokens given to each vertex that must be assigned to them.
In this note we propose the reformulation of several classical problems (vertex-cover, domination, independent domination, connectivity, distance and spanning tree) in this model ; then we propose solutions to solve them or we prove hardness results.
Domaines
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|---|
| Licence |