On the recognition of search trees generated by BFS and DFS

DOI10.1016/j.tcs.2022.09.018OpenAlexW4296410856MaRDI QIDQ2087463

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

zbMATH Keywords

BFSsplit graphsDFSgeneric searchgraph searchessearch tree recognition

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Uses Software

• Algorithm 447

Cites Work

• Unnamed Item
• Unnamed Item
• A general label search to investigate classical graph search algorithms
• Recognition of DFS trees: Sequential and parallel algorithms with refined verifications
• A tie-break model for graph search
• Recognizing breadth-first search trees in linear time
• Hamiltonian circuits in interval graph generalizations
• Edge-disjoint spanning trees and depth-first search
• HAMILTONian circuits in chordal bipartite graphs
• Graph-theoretic concepts in computer science. 48th international workshop, WG 2022, Tübingen, Germany, June 22--24, 2022. Revised selected papers
• Recognizing graph search trees
• Efficient Planarity Testing
• The Recognition Problem of Graph Search Trees
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: On the recognition of search trees generated by BFS and DFS