A General Label Search to Investigate Classical Graph Search Algorithms - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles Discrete Applied Mathematics Year : 2011

A General Label Search to Investigate Classical Graph Search Algorithms

Abstract

Many graph search algorithms use a labeling of the vertices to compute an ordering of the vertices. We generalize this idea by devising a general vertex labeling algorithmic process called General Label Search (GLS), which uses a labeling structure which, when specified, defines specific algorithms. We characterize the vertex orderings computable by the basic types of searches in terms of properties of their associated labeling structures. We then consider performing graph searches in the complement without computing it, and provide characterizations for some searches, but show that for some searches such as the basic Depth-First Search, no algorithm of the GLS family can exactly find all the orderings of the complement. Finally, we present some implementations and complexity results of GLS on a graph and on its complement.
Fichier principal
Vignette du fichier
publiGLS.pdf (322.27 Ko) Télécharger le fichier
Origin Publisher files allowed on an open archive
Loading...

Dates and versions

lirmm-00565874 , version 1 (14-02-2011)

Identifiers

Cite

Geneviève Simonet, Anne Berry, Richard Krueger. A General Label Search to Investigate Classical Graph Search Algorithms. Discrete Applied Mathematics, 2011, 159, pp.128-142. ⟨10.1016/j.dam.2010.02.011⟩. ⟨lirmm-00565874⟩
242 View
924 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More