A Family of Tree-Based Generators for Bubbles in Directed Graphs
From MaRDI portal
(Redirected from Publication:5041176)
Recommendations
- A family of tree-based generators for bubbles in directed graphs
- On bubble generators in directed graphs
- On bubble generators in directed graphs
- Publication:4489194
- Constructing independent spanning trees on bubble-sort networks
- Generation of Graphs with Bounded Branchwidth
- Random Generation of Directed Acyclic Graphs
- Random generation of essential directed acyclic graphs
- On Generating Random Network Structures: Trees
Cites work
- A note on fundamental, non-fundamental, and robust cycle bases
- Algorithms to compute minimum cycle basis in directed graphs
- Circuit bases of strongly connected digraphs
- Cycle bases in graphs characterization, algorithms, complexity, and applications
- scientific article; zbMATH DE number 2230298 (Why is no real title available?)
- scientific article; zbMATH DE number 3024665 (Why is no real title available?)
- Introduction to algorithms.
- Linear-time superbubble identification algorithm for genome assembly
- On bubble generators in directed graphs
- Robust cycle bases do not exist for \(K_{n, n}\) if \(n \geq 8\)
- Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for k-Vertex Connectivity
Cited in
(2)
This page was built for publication: A Family of Tree-Based Generators for Bubbles in Directed Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041176)
