A tie-break model for graph search
From MaRDI portal
Publication:896657
DOI10.1016/j.dam.2015.06.011zbMath1326.05151arXiv1501.06148OpenAlexW1631636474MaRDI QIDQ896657
Antoine Mamcarz, Jérémie Dusart, Fabien de Montgolfier, Derek Gordon Corneil, Michel A. Habib
Publication date: 10 December 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.06148
Related Items (5)
Robinsonian matrices: recognition challenges ⋮ Linearizing partial search orders ⋮ Similarity-First Search: A New Algorithm with Application to Robinsonian Matrix Recognition ⋮ Unnamed Item ⋮ On the recognition of search trees generated by BFS and DFS
Cites Work
- Unnamed Item
- A new LBFS-based algorithm for cocomparability graph recognition
- On computing the diameter of real-world undirected graphs
- Certifying algorithms
- A general label search to investigate classical graph search algorithms
- Some aspects of perfect elimination orderings in chordal graphs
- A strong-connectivity algorithm and its applications in data flow analysis
- LexBFS-orderings and powers of chordal graphs
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs
- A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs
- Algorithmic graph theory and perfect graphs
- On the Power of Graph Searching for Cocomparability Graphs
- LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs
- The LBFS Structure and Recognition of Interval Graphs
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- A Unified View of Graph Searching
- Algorithmic Aspects of Vertex Elimination on Graphs
- A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs
- Depth-First Search and Linear Graph Algorithms
- Graph-Theoretic Concepts in Computer Science
This page was built for publication: A tie-break model for graph search
