Sciweavers

DAM
2011

A General Label Search to investigate classical graph search algorithms

12 years 10 months ago
A General Label Search to investigate classical graph search algorithms
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.
Richard Krueger, Geneviève Simonet, Anne Be
Added 13 May 2011
Updated 13 May 2011
Type Journal
Year 2011
Where DAM
Authors Richard Krueger, Geneviève Simonet, Anne Berry
Comments (0)