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.
Type de document :
Article dans une revue
Discrete Applied Mathematics, Elsevier, 2011, 159, pp.128-142. 〈10.1016/j.dam.2010.02.011〉
Liste complète des métadonnées

Littérature citée [13 références]  Voir  Masquer  Télécharger

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00565874
Contributeur : Genevieve Simonet <>
Soumis le : lundi 14 février 2011 - 19:05:48
Dernière modification le : mardi 12 juin 2018 - 01:10:04

Fichier

publiGLS.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

Citation

Geneviève Simonet, Anne Berry, Richard Krueger. A General Label Search to Investigate Classical Graph Search Algorithms. Discrete Applied Mathematics, Elsevier, 2011, 159, pp.128-142. 〈10.1016/j.dam.2010.02.011〉. 〈lirmm-00565874〉

Partager

Métriques

Consultations de la notice

391

Téléchargements de fichiers

288