A tie-break model for graph search

Abstract

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 defined on the label set and it unifies the General Label Search (GLS… (More)
DOI: 10.1016/j.dam.2015.06.011

2 Figures and Tables

Topics

  • Presentations referencing similar topics