On the recognition of search trees generated by BFS and DFS
From MaRDI portal
Publication:2087463
DOI10.1016/J.TCS.2022.09.018OpenAlexW4296410856MaRDI QIDQ2087463FDOQ2087463
Authors: Robert Scheffler 
Publication date: 21 October 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.09.018
Recommendations
Cites Work
- Depth-First Search and Linear Graph Algorithms
- Recognizing graph search trees
- Efficient Planarity Testing
- Edge-disjoint spanning trees and depth-first search
- HAMILTONian circuits in chordal bipartite graphs
- Hamiltonian circuits in interval graph generalizations
- A general label search to investigate classical graph search algorithms
- Influence of the tie-break rule on the end-vertex problem
- The recognition problem of graph search trees
- Recognition of DFS trees: Sequential and parallel algorithms with refined verifications
- Recognizing breadth-first search trees in linear time
- A tie-break model for graph search
- Graph-theoretic concepts in computer science. 48th international workshop, WG 2022, Tübingen, Germany, June 22--24, 2022. Revised selected papers
- Title not available (Why is that?)
Cited In (5)
Uses Software
This page was built for publication: On the recognition of search trees generated by BFS and DFS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2087463)
