A tie-break model for graph search

Derek G. Corneil (1) , Jérémie Dusart (2) , Michel Habib (3) , Antoine Mamcarz (3) , Fabien de Montgolfier (3)

1 DCS - Department of Computer Science [University of Toronto]
2 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications
3 GANG - Networks, Graphs and Algorithms

In this paper, we consider the problem of the recognition of various kinds of orderings produced by graph searches. To this aim, we introduce a new framework, the Tie-Breaking Label Search (TBLS), in order to handle a broad variety of searches. This new model is based on partial orders dened on the label set and it unies the General Label Search (GLS) formalism of Krueger, Simonet and Berry (2011), and the \pattern-conditions" formalism of Corneil and Krueger (2008). It allows us to derive some general properties including new pattern-conditions (yielding memory-ecient certicates) for many usual searches, including BFS, DFS, LBFS and LDFS. Furthermore, the new model allows easy expression of multi-sweep uses of searches that depend on previous (search) orderings of the graph's vertex set.

Mots clés: LDFS; LBFS; DFS; Graph search model; tie-break mechanisms; BFS; multi-sweep algorithms.

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

Derek G. Corneil, Jérémie Dusart, Michel Habib, Antoine Mamcarz, Fabien de Montgolfier. A tie-break model for graph search. Discrete Applied Mathematics, 2016, 199, pp.89-100. ⟨10.1016/j.dam.2015.06.011⟩. ⟨hal-01255055⟩