On depth first search trees in m-out digraphs

DOI10.1007/BF01303205zbMATH Open0778.05037MaRDI QIDQ684408FDOQ684408

Authors: W. C. Stephen Suen 

Publication date: 15 September 1993

Published in: Combinatorica (Search for Journal in Brave)

Recommendations

• On the performance of the depth first search algorithm in supercritical random graphs
• Limiting shape of the depth first search tree in an Erdős-Rényi graph
• On the largest strong components in \(m\)-out digraphs
• On the existence of special depth first search trees
• Depth first exploration of a configuration model

zbMATH Keywords

treesrandom digraphsdepth first searchDFS tree\(m\)-out digraphs

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Title not available (Why is that?)
• Depth-First Search and Linear Graph Algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• The longest path in a random graph
• Title not available (Why is that?)
• On large matchings and cycles in sparse random graphs
• On the largest strong components in \(m\)-out digraphs
• On large induced trees and long induced paths in sparse random graphs

Cited In (7)

• On the largest strong components in \(m\)-out digraphs
• On large induced trees and long induced paths in sparse random graphs
• On the existence of special depth first search trees
• Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits
• Limiting shape of the depth first search tree in an Erdős-Rényi graph
• On the performance of the depth first search algorithm in supercritical random graphs
• Depth-first search performance in a random digraph with geometric outdegree distribution

This page was built for publication: On depth first search trees in \(m\)-out digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q684408)