scientific article

zbMath1078.68833MaRDI QIDQ3046492

Alexander Golynski, J. D. Horton

Publication date: 12 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2368/23680200.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial aspects of matroids and geometric lattices (05B35) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (19)

Covering Vectors by Spaces: Regular Matroids ⋮ Classes of cycle bases ⋮ Minimum cycle bases of weighted outerplanar graphs ⋮ Cycle-based formulations in distance geometry ⋮ On a Special Co-cycle Basis of Graphs ⋮ New approximation algorithms for minimum cycle bases of graphs ⋮ Cycle bases in graphs characterization, algorithms, complexity, and applications ⋮ Minimum cycle bases of graphs on surfaces ⋮ Minimum cut bases in undirected networks ⋮ A comparative study of algorithms for minimal cycle bases for efficient force method of frame analysis ⋮ A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid ⋮ An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs ⋮ Integral cycle bases for cyclic timetabling ⋮ A cycle-based formulation for the distance geometry problem ⋮ Minimum Cycle Bases and Their Applications ⋮ Minimum weakly fundamental cycle bases are hard to find ⋮ Properties of Gomory-Hu co-cycle bases ⋮ A greedy approach to compute a minimum cycle basis of a directed graph ⋮ On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes)

This page was built for publication: