Algorithms for Generating Fundamental Cycles in a Graph

Cited In (37)

The zoo of tree spanner problems
Minimum cut bases in undirected networks
A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block
Minimum strictly fundamental cycle bases of planar graphs are hard to find
On Optimum Cycle Bases
Cycle bases in graphs characterization, algorithms, complexity, and applications
Algorithmic parameterization of mixed treatment comparisons
Edge-swapping algorithms for the minimum fundamental cycle basis problem
On the approximability of the minimum strictly fundamental cycle basis problem
On the stability properties of linear dynamic time-varying unforced systems involving switches between parameterizations from topologic considerations via graph theory
On finding a cycle basis with a shortest maximal cycle
Algorithms for finding minimum fundamental cycle bases in graphs
An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs
The Hamilton spaces of Cayley graphs on abelian groups
Minimum weakly fundamental cycle bases are hard to find
The Null Space Problem I. Complexity
Minimum Cycle Bases and Their Applications
On minimum average stretch spanning trees in polygonal 2-trees
Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion
Distance geometry and data science
Lower bounds for strictly fundamental cycle bases in grid graphs
Minimum spanning tree cycle intersection problem on outerplanar graphs
Advances in metric embedding theory
The Dual Variable Method for the Solution of Compressible Fluid Flow Problems
Modeling the dynamics of complex multibody systems with kinematical transmission elements
The Null Space Problem II. Algorithms
Classes of cycle bases
Properties of Gomory-Hu co-cycle bases
A cycle-based formulation for the distance geometry problem
Integral cycle bases for cyclic timetabling
Characterizing attitudinal network graphs through frustration cloud
Minimum spanning tree cycle intersection problem
Cycle-based formulations in distance geometry
On minimum average stretch spanning trees in grid graphs
Perfect hashing
New length bounds for cycle bases
Sparse null basis computations in structural optimization

This page was built for publication: Algorithms for Generating Fundamental Cycles in a Graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3933763)