Cites work
- A greedy approach to compute a minimum cycle basis of a directed graph
- A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
- Algorithms to compute minimum cycle basis in directed graphs
- An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs
- Classes of cycle bases
- Community structure in social and biological networks
- Cycle bases in graphs characterization, algorithms, complexity, and applications
- Eigenvalues and eigenvectors of tridiagonal matrices
- Experimental and Efficient Algorithms
- Faster Algorithms for Minimum Cycle Basis in Directed Graphs
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- Networks beyond pairwise interactions: structure and dynamics
- Networks. An introduction.
- On cycle bases of a graph
- The elements of statistical learning. Data mining, inference, and prediction
- The Transitive Reduction of a Directed Graph
- What is the dimension of citation space?
Cited in
(4)
This page was built for publication: Cycle analysis of directed acyclic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2128678)