A faster algorithm for minimum cycle basis of graphs
From MaRDI portal
Recommendations
Cited in
(45)- An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs
- Integral cycle bases for cyclic timetabling
- Edge-swapping algorithms for the minimum fundamental cycle basis problem
- Minimum weakly fundamental cycle bases are hard to find
- A greedy approach to compute a minimum cycle basis of a directed graph
- Length bounds for cycle bases of graphs
- Minimum cycle bases of weighted outerplanar graphs
- Approximating the minimum cycle mean
- New length bounds for cycle bases
- Minimum cycle bases of graphs on surfaces
- The zoo of tree spanner problems
- An optimal \(O(N^{2})\) algorithm for computing the min-transitive closure of a weighted graph
- A polynomial time algorithm to find the minimum cycle basis of a regular matroid
- Minimum Path Bases
- Minimum path bases and relevant paths
- Faster Algorithms for Minimum Cycle Basis in Directed Graphs
- Algorithms for finding minimum fundamental cycle bases in graphs
- Implementing minimum cycle basis algorithms
- On a Special Co-cycle Basis of Graphs
- Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs
- New Approximation Algorithms for Minimum Cycle Bases of Graphs
- Minimum Cycle Bases and Their Applications
- Breaking the O(m 2 n) Barrier for Minimum Cycle Bases
- A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
- Revised Greedy algorithm for formation of a minimal cycle basis of a graph
- scientific article; zbMATH DE number 1045607 (Why is no real title available?)
- Cycle bases in graphs characterization, algorithms, complexity, and applications
- A faster algorithm to update betweenness centrality after node alteration
- Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs
- Approximating the minimum cycle mean
- A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph
- Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs
- Implementing minimum cycle basis algorithms
- An \(\tilde O( m^{2} n )\) randomized algorithm to compute a minimum cycle basis of a directed graph
- scientific article; zbMATH DE number 7760193 (Why is no real title available?)
- New approximation algorithms for minimum cycle bases of graphs
- Minimum cycle bases, faster and simpler
- Computing cyclic invariants for molecular graphs
- Fast algorithms for minimum homology basis
- Cycle bases of graphs and sampled manifolds
- Properties of Gomory-Hu co-cycle bases
- Classes of cycle bases
- Algorithms for shortest paths and d-cycle problems
- Minimum cut bases in undirected networks
- Efficient approximation algorithms for shortest cycles in undirected graphs
This page was built for publication: A faster algorithm for minimum cycle basis of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5466519)
