Work

On Minimum Connecting Transition Sets in Graphs

Year: 2018

Type: preprint

Abstract: 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.

Source: HAL (Le Centre pour la Communication Scientifique Directe)

DOI: 10.48550/arxiv.1807.08463

Authors: Bellitto, Thomas, Bergougnoux, Benjamin

Institutions: Laboratoire Bordelais de Recherche en Informatique, Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2950432091

Cites: 8

Cited by: 1

Related to: 10