Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,303 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
15 relations
Adjacency matrix
Breadth-first search
Cograph
Complement graph
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Simpler, Linear-Time Transitive Orientation via Lexicographic Breadth-First Search
Marc Tedder
arXiv.org
2015
Corpus ID: 15184893
Comparability graphs are the undirected graphs whose edges can be directed so that the resulting directed graph is transitive…
Expand
2011
2011
Consistency of Qualitative Constraint Networks from Tree Decompositions
Jean-François Condotta
,
Dominique D'Almeida
Eighteenth International Symposium on Temporal…
2011
Corpus ID: 236982
A common way to decide the consistency problem of a qualitative constraint network (QCN) is to encode it as a boolean formula in…
Expand
2009
2009
Representing and Querying Uncertain Data
Prithviraj Sen
2009
Corpus ID: 290900
There has been a longstanding interest in building systems that can handle uncertain data. Traditional database systems…
Expand
2008
2008
A Lexbfs Algorithm for Proper Interval Graph Recognition a Lexbfs Algorithm for Proper Interval Graph Recognition
C. M. Figueiredo
,
J. Meidanis
,
Joao Meidanisy
,
elia Picinin de Melloz
2008
Corpus ID: 50374472
Interval graphs are the intersection graphs of families of intervals in the real line. If the intervals can be chosen so that no…
Expand
2007
2007
Coloration de graphes : structures et algorithmes
Benjamin Lévêque
2007
Corpus ID: 187647329
De nombreux problemes appliques peuvent etre modelises par le probleme de la coloration des sommets d'un graphe, qui est NP…
Expand
2005
2005
Ultimate Generalizations of LexBFS and LEX M
Anne Berry
,
Richard Krueger
,
Geneviève Simonet
International Workshop on Graph-Theoretic…
2005
Corpus ID: 10698289
Many graph search algorithms use a labelling of the vertices to compute an ordering of the vertices. We examine such algorithms…
Expand
2003
2003
LexBFS-orderings and powers of chordal graphs 1
2003
Corpus ID: 52830144
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…
Expand
2000
2000
Local LexBFS Properties in an Arbitrary Graph
Anne Berry
,
J. Bordat
2000
Corpus ID: 118166924
1999
1999
A Linear Algorithm to Color i-Triangulated Graphs
F. Roussel
,
I. Rusu
Information Processing Letters
1999
Corpus ID: 8942402
1999
1999
Lexbfs-orderings and powers of hhd-free graphs
F. Dragan
,
F. Nicolai
International Journal of Computational…
1999
Corpus ID: 40245799
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…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE