On end-vertices of lexicographic breadth first searches
From MaRDI portal
(Redirected from Publication:968161)
Recommendations
Cites work
- scientific article; zbMATH DE number 176590 (Why is no real title available?)
- scientific article; zbMATH DE number 1303554 (Why is no real title available?)
- A Unified View of Graph Searching
- Algorithmic Aspects of Vertex Elimination on Graphs
- Almost diameter of a house-hole-free graph in linear time via LexBFS
- Diameter determination on restricted graph families
- Domination on Cocomparability Graphs
- Graph-Theoretic Concepts in Computer Science
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
- LexBFS-orderings and powers of chordal graphs
- Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
- Representation of a finite graph by a set of intervals on the real line
Cited in
(12)- Graph searches and their end vertices
- Graph Search Trees and Their Leaves
- Influence of the tie-break rule on the end-vertex problem
- A tie-break model for graph search
- End-vertices of graph search algorithms
- Recognizing graph search trees
- End vertices of graph searches on bipartite graphs
- Graph-Theoretic Concepts in Computer Science
- Similarity-first search: a new algorithm with application to Robinsonian matrix recognition
- Linearizing partial search orders
- The recognition problem of graph search trees
- End-vertices of LBFS of (AT-free) bigraphs
This page was built for publication: On end-vertices of lexicographic breadth first searches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968161)