On Minimum Connecting Transition Sets in Graphs

Thomas Bellitto (1) , Benjamin Bergougnoux (2)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique
2 LIMOS - Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes

A forbidden transition graph is a graph defined together with a set of permitted transitions i.e. unordered pair of adjacent edges that one may use consecutively in a walk in the graph. In this paper, we look for the smallest set of transitions needed to be able to go from any vertex of the given graph to any other. We prove that this problem is NP-hard and study approximation algorithms. We develop theoretical tools that help to study this problem.

Domaines: Algorithme et structure de données [cs.DS]

Thomas Bellitto, Benjamin Bergougnoux. On Minimum Connecting Transition Sets in Graphs. 2018. ⟨hal-01846961v2⟩