Graph search trees and the Intermezzo problem
From MaRDI portal
Cites work
- A decomposition theorem for partially ordered sets
- A Note on "The Comparability Graph of a Tree"
- A Unified View of Graph Searching
- Algorithmic Aspects of Vertex Elimination on Graphs
- DFS tree construction: Algorithms and characterizations
- Efficient Planarity Testing
- End vertices of graph searches on bipartite graphs
- Graph Search Trees and Their Leaves
- scientific article; zbMATH DE number 53952 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Influence of the tie-break rule on the end-vertex problem
- Introduction to algorithms
- Linearizing partial search orders
- Lower bounds based on the exponential time hypothesis
- Minimizing setups in ordered sets of fixed width
- On end-vertices of lexicographic breadth first searches
- On the end-vertex problem of graph searches
- On the parameterized complexity of multiple-interval graph problems
- On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
- On the recognition of search trees generated by BFS and DFS
- Parameterized algorithms
- Recognizing breadth-first search trees in linear time
- Recognizing LBFS trees of bipartite graphs
- Sur l'extension de l'ordre partiel.
- The recognition problem of graph search trees
This page was built for publication: Graph search trees and the Intermezzo problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7241021)
