On the recognition of search trees generated by BFS and DFS
type: Item
instance of: scholarly article
title: On the recognition of search trees generated by BFS and DFS
author: Robert Scheffler
published in: Theoretical Computer Science
publication date: 2022-10-21T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7604604
zbMATH Keywords: graph searches
zbMATH Keywords: search tree recognition
zbMATH Keywords: BFS
zbMATH Keywords: DFS
zbMATH Keywords: generic search
zbMATH Keywords: split graphs
describes a project that uses: Algorithm 447
MaRDI profile type: Publication
full work available at URL: j.tcs.2022.09.018
OpenAlex ID: W4296410856
cites work: Recognizing graph search trees
cites work: The Recognition Problem of Graph Search Trees
cites work: Q5125290
cites work: Hamiltonian circuits in interval graph generalizations
cites work: Influence of the tie-break rule on the end-vertex problem
cites work: A tie-break model for graph search
cites work: Efficient Planarity Testing
cites work: Recognition of DFS trees: Sequential and parallel algorithms with refined verifications
cites work: A general label search to investigate classical graph search algorithms
cites work: Recognizing breadth-first search trees in linear time
cites work: HAMILTONian circuits in chordal bipartite graphs
cites work: Graph-theoretic concepts in computer science. 48th international workshop, WG 2022, Tübingen, Germany, June 22--24, 2022. Revised selected papers
cites work: Depth-First Search and Linear Graph Algorithms
cites work: Edge-disjoint spanning trees and depth-first search
DOI: 10.1016/J.TCS.2022.09.018
description: scientific article; zbMATH DE number 7604604