On depth first search trees in m-out digraphs
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 3904630 (Why is no real title available?)
- scientific article; zbMATH DE number 3906496 (Why is no real title available?)
- scientific article; zbMATH DE number 3693325 (Why is no real title available?)
- scientific article; zbMATH DE number 3232032 (Why is no real title available?)
- Depth-First Search and Linear Graph Algorithms
- On large induced trees and long induced paths in sparse random graphs
- On large matchings and cycles in sparse random graphs
- On the largest strong components in m-out digraphs
- The longest path in a random graph
Cited in
(7)- Depth-first search performance in a random digraph with geometric outdegree distribution
- 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
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)
