Rooted cycle bases
From MaRDI portal
Recommendations
Cites work
- A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
- Cycle bases in graphs characterization, algorithms, complexity, and applications
- Depth-First Search and Linear Graph Algorithms
- Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs
- Exploratory Projection Pursuit
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- Implementing minimum cycle basis algorithms
- Improved cycle bases for the flexibility analysis of structures
- Minimum weakly fundamental cycle bases are hard to find
- Multiresolution Approximations and Wavelet Orthonormal Bases of L 2 (R)
- New length bounds for cycle bases
- On the 2-factors of bicubic graphs
- Periodic Timetable Optimization in Public Transport
- Symbolic processing of multiloop mechanism dynamics using closed-form kinematics solutions
- When graph theory helps self-stabilization
Cited in
(7)- A note on fundamental, non-fundamental, and robust cycle bases
- The minimum rooted-cycle cover problem
- Is every cycle basis fundamental?
- A note on quasi-robust cycle bases
- Cycle bases in graphs characterization, algorithms, complexity, and applications
- Classification of robust cycle bases and relations to fundamental cycle bases
- Rooted cycle bases
This page was built for publication: Rooted cycle bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3449832)