Skip to Main content Skip to Navigation

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.
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Genevieve Simonet <>
Submitted on : Thursday, March 26, 2009 - 4:39:32 PM
Last modification on : Wednesday, April 21, 2021 - 8:52:05 AM
Long-term archiving on: : Friday, October 12, 2012 - 2:25:36 PM


Files produced by the author(s)


  • HAL Id : lirmm-00371177, version 1


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



Record views


Files downloads