Lexicographic breadth-first search
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
- 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
- 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
- 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
- 2005
Graph searching is fundamental. Many graph algorithms employ some mechanism for systematically visiting all vertices and edges of… (More)
Is this relevant?
2005
2004
2004
- SIAM J. Discrete Math.
- 2004
Is this relevant?
1999
1999
- 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
- 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
1993
1993
- 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?