Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of Chip-firing game on directed graphs - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Annals of Combinatorics Année : 2015

Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of Chip-firing game on directed graphs

Résumé

In this paper we present further studies of recurrent configurations of chip-firing games on Eulerian directed graphs (simple digraphs), a class on the way from undirected graphs to general directed graphs. A computational problem that arises naturally from this model is to find the minimum number of chips of a recurrent configuration, which we call the minimum recurrent configuration (MINREC) problem. We point out a close relationship between MINREC and the minimum feedback arc set (MINFAS) problem on Eulerian directed graphs, and prove that both problems are NP-hard.

Dates et versions

hal-01459881 , version 1 (07-02-2017)

Identifiants

Citer

Kévin Perrot, Trung van Pham. Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of Chip-firing game on directed graphs. Annals of Combinatorics, 2015, 19 (2), pp.373-396. ⟨10.1007/s00026-015-0266-9⟩. ⟨hal-01459881⟩
33 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More