Lexicographic breadth-first search

Known as: LexBFS, Lexicographic BFS

In computer science, lexicographic breadth-first search or Lex-BFS is a linear time algorithm for ordering the vertices of a graph. The algorithm is…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2015

Comparability graphs are the undirected graphs whose edges can be directed so that the resulting directed graph is transitive…

2011

A common way to decide the consistency problem of a qualitative constraint network (QCN) is to encode it as a boolean formula in…

2009

There has been a longstanding interest in building systems that can handle uncertain data. Traditional database systems…

2008

Interval graphs are the intersection graphs of families of intervals in the real line. If the intervals can be chosen so that no…

2007

De nombreux problemes appliques peuvent etre modelises par le probleme de la coloration des sommets d'un graphe, qui est NP…

2005

Many graph search algorithms use a labelling of the vertices to compute an ordering of the vertices. We examine such algorithms…

2003

For an undirected graph G the kth power G k of G is the graph with the same vertex set as G where two vertices are adjacent iff…

2000

1999

1999

The k-th power of a graph G is the graph with the same vertex set as G where two vertices are adjacent iff their distance in G is…