The partial search order problem
From MaRDI portal
Cites work
- A Simple Linear Time LexBFS Cograph Recognition Algorithm
- A Unified View of Graph Searching
- A decomposition theorem for partially ordered sets
- A general label search to investigate classical graph search algorithms
- A new LBFS-based algorithm for cocomparability graph recognition
- A polynomial-time algorithm for MCS partial search order on chordal graphs
- A tie-break model for graph search
- Algorithmic Aspects of Vertex Elimination on Graphs
- Computing Hamiltonian paths with partial order restrictions
- DFS tree construction: Algorithms and characterizations
- Efficient Planarity Testing
- End-vertices of LBFS of (AT-free) bigraphs
- End-vertices of graph search algorithms
- Graph Searches and Their End Vertices.
- Graph searches and their end vertices
- Influence of the tie-break rule on the end-vertex problem
- LDFS-based certifying algorithm for the minimum path cover problem on cocomparability graphs
- LexBFS-orderings and powers of chordal graphs
- Linearizing partial search orders
- Maximum cardinality search for computing minimal triangulations of graphs
- 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 recognition of search trees generated by BFS and DFS
- Recognizing LBFS trees of bipartite graphs
- Recognizing breadth-first search trees in linear time
- Recognizing graph search trees
- 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
- The splittance of a graph
This page was built for publication: The partial search order problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6901258)
