Algorithms for Generating Fundamental Cycles in a Graph
From MaRDI portal
Publication:3933763
DOI10.1145/355984.355988zbMATH Open0477.68070OpenAlexW1984040953MaRDI QIDQ3933763FDOQ3933763
Mukkai S. Krishnamoorthy, Narsingh Deo, G. M. Prabhu
Publication date: 1982
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/355984.355988
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)
Cited In (37)
- The zoo of tree spanner problems
- Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion
- 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
- 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)