A tie-break model for graph search - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Applied Mathematics Year : 2016

A tie-break model for graph search


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.

Dates and versions

hal-01255055 , version 1 (13-01-2016)



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⟩
157 View
0 Download



Gmail Facebook X LinkedIn More