Cycle analysis of directed acyclic graphs
From MaRDI portal
Publication:2128678
DOI10.1016/j.physa.2022.127097OpenAlexW4214487273MaRDI QIDQ2128678
Paul Expert, Vaiva Vasiliauskaite, Tim S. Evans
Publication date: 22 April 2022
Published in: Physica A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.02475
complex systemsstatisticsdata sciencedirected acyclic graphsnetwork theorytransitive reductionminimal cycle bases
Related Items
Cites Work
- Unnamed Item
- Cycle bases in graphs characterization, algorithms, complexity, and applications
- Networks beyond pairwise interactions: structure and dynamics
- Classes of cycle bases
- An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs
- A greedy approach to compute a minimum cycle basis of a directed graph
- What is the dimension of citation space?
- Algorithms to compute minimum cycle basis in directed graphs
- On cycle bases of a graph
- Faster Algorithms for Minimum Cycle Basis in Directed Graphs
- A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
- Community structure in social and biological networks
- Eigenvalues and eigenvectors of tridiagonal matrices
- The Transitive Reduction of a Directed Graph
- Experimental and Efficient Algorithms
- Networks
- The elements of statistical learning. Data mining, inference, and prediction