Graph Search Trees and Their Leaves
From MaRDI portal
Graph Search Trees and Their Leaves
Cites work
- A general label search to investigate classical graph search algorithms
- A tie-break model for graph search
- A Unified View of Graph Searching
- Algorithmic Aspects of Vertex Elimination on Graphs
- Algorithms for weakly triangulated graphs
- DFS tree construction: Algorithms and characterizations
- Diameter determination on restricted graph families
- Dominating cliques in chordal graphs
- Efficient Planarity Testing
- End vertices of graph searches on bipartite graphs
- End-vertices of graph search algorithms
- End-vertices of LBFS of (AT-free) bigraphs
- Graph searches and their end vertices
- scientific article; zbMATH DE number 7651152 (Why is no real title available?)
- Influence of the tie-break rule on the end-vertex problem
- Into the square: on the complexity of some quadratic-time solvable problems
- LDFS-based certifying algorithm for the minimum path cover problem on cocomparability graphs
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
- Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
- Linearizing partial search orders
- Maximum cardinality search for computing minimal triangulations of graphs
- On end-vertices of lexicographic breadth first searches
- On the end-vertex problem of graph searches
- On the recognition of search trees generated by BFS and DFS
- Recognizing breadth-first search trees in linear time
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- The LBFS structure and recognition of interval graphs
- The recognition problem of graph search trees
- Triangulated graphs and the elimination process
This page was built for publication: Graph Search Trees and Their Leaves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6496559)
