Minimum Cycle Bases in Graphs Algorithms and Applications
From MaRDI portal
Publication:3525552
Recommendations
Cited in
(29)- Cycle systems
- scientific article; zbMATH DE number 2080984 (Why is no real title available?)
- Minimum cycle bases for network graphs
- scientific article; zbMATH DE number 3865322 (Why is no real title available?)
- scientific article; zbMATH DE number 7760193 (Why is no real title available?)
- Is every cycle basis fundamental?
- Cycle bases from orderings and coverings
- scientific article; zbMATH DE number 4198023 (Why is no real title available?)
- Properties of Gomory-Hu co-cycle bases
- When do short cycles generate the cycle space?
- The minimal cycle basis of circular graphs
- On a Special Co-cycle Basis of Graphs
- Cycle bases in graphs characterization, algorithms, complexity, and applications
- Convex cycle bases
- Rooted cycle bases
- Revised Greedy algorithm for formation of a minimal cycle basis of a graph
- Minimum fundamental cycle basis of some bipartite graphs
- On the approximability of the minimum strictly fundamental cycle basis problem
- Graph bases and diagram commutativity
- Cycle bases of graphs and sampled manifolds
- New approximation algorithms for minimum cycle bases of graphs
- Circuit bases of strongly connected digraphs
- Minimum cycle bases of weighted outerplanar graphs
- Rooted cycle bases
- Classes of cycle bases
- The lattice of cycles of an undirected graph
- Edge-swapping algorithms for the minimum fundamental cycle basis problem
- Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs
- Minimum Cycle Bases and Their Applications
This page was built for publication: Minimum Cycle Bases in Graphs Algorithms and Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3525552)