Influence of the tie-break rule on the end-vertex problem - Inria - Institut national de recherche en sciences et technologies du numérique
Article Dans Une Revue Discrete Mathematics and Theoretical Computer Science Année : 2014

Influence of the tie-break rule on the end-vertex problem

Pierre Charbit
Michel Habib
Antoine Mamcarz
  • Fonction : Auteur
  • PersonId : 950217

Résumé

End-vertices of a given graph search may have some nice properties, as for example it is well known that the last vertex of Lexicographic Breadth First Search (LBFS) in a chordal graph is simplicial, see Rose, Tarjan and Lueker 1976. Therefore it is interesting to consider if these vertices can be recognized in polynomial time or not, as first studied in Corneil, Köhler and Lanlignel 2010. A graph search is a mechanism for systematically visiting the vertices of a graph. At each step of a graph search, the key point is the choice of the next vertex to be explored. Graph searches only differ by this selection mechanism during which a tie-break rule is used. In this paper we study how the choice of the tie-break in case of equality during the search, for a given graph search including the classic ones such as BFS and DFS, can determine the complexity of the end-vertex problem. In particular we prove a counterintuitive NP-completeness result for Breadth First Search solving a problem raised in Corneil, Köhler and Lanlignel 2010.
Fichier principal
Vignette du fichier
dmtcs-16-2-5.pdf (238.87 Ko) Télécharger le fichier
Origine Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01101514 , version 1 (04-11-2015)

Identifiants

Citer

Pierre Charbit, Michel Habib, Antoine Mamcarz. Influence of the tie-break rule on the end-vertex problem. Discrete Mathematics and Theoretical Computer Science, 2014, Vol. 16 no. 2, pp.57-72. ⟨10.46298/dmtcs.2081⟩. ⟨hal-01101514⟩
315 Consultations
1131 Téléchargements

Altmetric

Partager

More