Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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

Related topics

Related topics

15 relations
Adjacency matrixBreadth-first searchCographComplement graph
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Similarity-First Search: A New Algorithm with Application to Robinsonian Matrix Recognition
We present a new efficient combinatorial algorithm for recognizing if a given symmetric matrix is Robinsonian, i.e., if its rows… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
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… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2014
2014
Organizing the atoms of the clique separator decomposition into an atom tree
Abstract We define an atom tree of a graph as a generalization of a clique tree: its nodes are the atoms obtained by clique… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2011
2011
Applications of lexicographic breadth-first search to modular decomposition, split decomposition, and circle graphs
This thesis presents the first sub-quadratic circle graph recognition algorithm, and develops improved algorithms for two… Expand
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 2.4
  • figure 3.1
Is this relevant?
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
Graph Extremities Defined by Search Algorithms
Graph search algorithms have exploited graph extremities, such as the leaves of a tree and the simplicial vertices of a chordal… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
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… Expand
Is this relevant?
2001
2001
Diameter determination on restricted graph families
Determining the diameter of a graph is a fundamental graph operation, yet no efficient (i.e. linear or quadratic time) algorithm… Expand
Is this relevant?
2001
2001
Polynomially Improved Efficiency for Fast Parallel Single-Source Lexicographic Depth-First Search, Breadth-First Search, and Topological-First Search
Abstract. Although lexicographic (lex) variants of greedy algorithms are often P -complete, NC -algorithms are… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2000
2000
Local LexBFS Properties in an Arbitrary Graph
 
  • figure 1
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE