Algorithms for Generating Fundamental Cycles in a Graph

Cited in

(38)

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

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)