All Fields
Computer Science
Medicine
FAQ
Contact
Sign in
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…
(More)
Wikipedia
Topic mentions per year
Topic mentions per year
1993-2017
0
1
2
3
1993
2017
Related topics
Related topics
15 relations
Adjacency matrix
Breadth-first search
Cograph
Complement graph
(More)
Related mentions per year
Related mentions per year
1937-2018
1960
1980
2000
2020
Lexicographic breadth-first search
Computer science
Graph coloring
Sorting algorithm
Adjacency matrix
Lexicographical order
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Vertex elimination orderings for hereditary graph classes
Pierre Aboulker
,
Pierre Charbit
,
Nicolas Trotignon
,
Kristina Vuskovic
Discrete Mathematics
2015
We provide a general method to prove the existence and compute efficiently elimination orderings in graphs. Our method relies on…
(More)
Is this relevant?
2011
2011
4:45- 5:15 Coffee Break
Marko Radovanovic
2011
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…
(More)
Is this relevant?
2008
2008
A Lexbfs Algorithm for Proper Interval Graph Recognition a Lexbfs Algorithm for Proper Interval Graph Recognition
Celina M. Herrera de Figueiredo
,
Joao Meidanisy
2008
Interval graphs are the intersection graphs of families of intervals in the real line. If the intervals can be chosen so that no…
(More)
Is this relevant?
2005
2005
Simple vertex ordering characterizations for graph search
Derek G. Corneil
,
Richard Krueger
2005
Graph searching is fundamental. Many graph algorithms employ some mechanism for systematically visiting all vertices and edges of…
(More)
Is this relevant?
2005
2005
Ultimate Generalizations of LexBFS and LEX M
Anne Berry
,
Richard Krueger
,
Geneviève Simonet
WG
2005
Is this relevant?
2004
2004
Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs
Pavol Hell
,
Jing Huang
SIAM J. Discrete Math.
2004
Is this relevant?
1999
1999
LexBFS-Ordering in Asteroidal Triple-Free Graphs
Jou-Ming Chang
,
Chin-Wen Ho
,
Ming-Tat Ko
ISAAC
1999
In this paper, we study the metric property of LexBFS-ordering on AT-free graphs. Based on a 2-sweep LexBFS algorithm, we show…
(More)
Is this relevant?
1998
1998
Separability Generalizes Dirac's Theorem
Anne Berry
,
Jean Paul Bordat
Discrete Applied Mathematics
1998
In our study of the extremities of a graph, we define a moplex as a maximal clique module the neighborhood of which is a minimal…
(More)
Is this relevant?
1997
1997
LexBFS-orderings and powers of chordal graphs
Andreas Brandstädt
,
Feodor F. Dragan
,
Falk Nicolai
Discrete Mathematics
1997
Is this relevant?
1993
1993
A lexBFS Algorithm for Proper Interval GraphRecognitionCelina
Celina M. Herrera de Figueiredo
,
Celina M. Herrera
1993
Interval graphs are the intersection graphs of families of intervals in the real line. If the intervals can be chosen so that no…
(More)
Is this relevant?