A matroid view of key theorems for edge-swapping algorithms

DOI10.1007/S00186-012-0392-7MaRDI QIDQ1935946zbMATH OpenOpenAlexFDO

Authors Jon Lee, Leo Liberti

Publication date 20 February 2013

Published in Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00186-012-0392-7

zbMATH Keywords

binary matroidedge swappingfundamental circuit

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 2086910
• Edge reconstruction and the swapping number of a graph
• Edge-swapping algorithms for the minimum fundamental cycle basis problem
• On circuit exchange properties for matroids
• Switching techniques for edge decompositions of graphs
• A new exchange property for matroids and its application to max-min-problems
• The bipartite swapping trick on graph homomorphisms
• On some algorithmic aspects of hypergraphic matroids
• An exchange property of matroids
• scientific article; zbMATH DE number 4089608

Cites work

• Edge-swapping algorithms for the minimum fundamental cycle basis problem
• scientific article; zbMATH DE number 420868 (Why is no real title available?)

Cited in

(2)

• A cycle-based formulation for the distance geometry problem
• Cycle-based formulations in distance geometry

This page was built for publication: A matroid view of key theorems for edge-swapping algorithms

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