Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

15 relations
Adjacency matrixBreadth-first searchCographComplement graph

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
Comparability graphs are the undirected graphs whose edges can be directed so that the resulting directed graph is transitive… 
2012
2012
Efficiently recognizing , decomposing and triangulating hole-and diamond-free graphs
We show that the atoms by clique separator decomposition of holeand diamond-free graphs are of three simple types: clique… 
2011
2011
Consistency of Qualitative Constraint Networks from Tree Decompositions
A common way to decide the consistency problem of a qualitative constraint network (QCN) is to encode it as a boolean formula in… 
2011
2011
Tight bounds for linkages in planar graphs
9:30 10:30 Paul Seymour, “Disjoint paths in tournaments” 10:30 11:00 Coffee Break 11:00 11:20 Tony Huynh, “Explicit bounds for… 
2009
2009
Representing and Querying Uncertain Data
There has been a longstanding interest in building systems that can handle uncertain data. Traditional database systems… 
2008
2008
A Lexbfs Algorithm for Proper Interval Graph Recognition a Lexbfs Algorithm for Proper Interval Graph Recognition
Interval graphs are the intersection graphs of families of intervals in the real line. If the intervals can be chosen so that no… 
2005
2005
Ultimate Generalizations of LexBFS and LEX M
Many graph search algorithms use a labelling of the vertices to compute an ordering of the vertices. We examine such algorithms… 
2000
2000
Local LexBFS Properties in an Arbitrary Graph
1999
1999
A Linear Algorithm to Color i-Triangulated Graphs
1999
1999
Lexbfs-orderings and powers of hhd-free graphs
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… 
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)