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
Reports Year : 2009

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. \par 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
krueger_al_GLS.pdf (212.88 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-00371177 , version 1 (26-03-2009)

Identifiers

  • HAL Id : lirmm-00371177 , version 1

Cite

Richard Krueger, Geneviève Simonet, Anne Berry. A General Label Search to Investigate Classical Graph Search Algorithms. 09006, 2009. ⟨lirmm-00371177⟩
151 View
426 Download

Share

Gmail Facebook X LinkedIn More