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

Authors:
Christophe Crespelle;Philippe Gambette
Affiliations:
LIP6 - Université Pierre & Marie Curie, CNRS, France;LIRMM - Université Montpellier 2, CNRS, France
Venue:
Information Processing Letters
Year:
2010

Citing 7
Cited 1

Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs

Information Processing Letters
Steiner set and connected domination in trapezoid graphs

Information Processing Letters
Finding biconnected components in O(n) time for a class of graphs

Information Processing Letters
An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs

Information Processing Letters
A linear time algorithm for finding depth-first spanning trees on trapezoid graphs

Information Processing Letters
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Estimating all pairs shortest paths in restricted graph families: a unified approach

Journal of Algorithms

Efficient algorithm for the vertex connectivity of trapezoid graphs

Information Processing Letters

Quantified Score

Hi-index	0.89

Visualization

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.