Unrestricted and complete Breadth-First Search of trapezoid graphs in O(n) time - Archive ouverte HAL Access content directly
Journal Articles Information Processing Letters Year : 2010

Unrestricted and complete Breadth-First Search of trapezoid graphs in O(n) time

Christophe Crespelle
  • Function : Correspondent author
  • PersonId : 863155

Connectez-vous pour contacter l'auteur

Abstract

We present an O(n) Breadth-First Search algorithm for trapezoid graphs, which takes as input a trapezoid model and any priority order on the vertices. Our algorithm is the first able to produce any BFS-tree, and not only one specific to the model given as input, within this complexity. Moreover, it produces all the shortest paths from the root of the BFS-tree to the other vertices of the graph.
Fichier principal
Vignette du fichier
2010CrespelleGambette.pdf (253.17 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

lirmm-00469844 , version 1 (02-04-2010)

Identifiers

Cite

Christophe Crespelle, Philippe Gambette. Unrestricted and complete Breadth-First Search of trapezoid graphs in O(n) time. Information Processing Letters, 2010, 110, pp.497-502. ⟨10.1016/j.ipl.2010.03.015⟩. ⟨lirmm-00469844⟩
396 View
296 Download

Altmetric

Share

Gmail Facebook X LinkedIn More