A matroid view of key theorems for edge-swapping algorithms
type: Item
instance of: scholarly article
title: A matroid view of key theorems for edge-swapping algorithms
zbMATH Open document ID: 1272.90107
author: Jon Lee
author: Leo Liberti
published in: Mathematical Methods of Operations Research
publication date: 2013-02-20T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 05B35
zbMATH DE Number: 6137610
zbMATH Keywords: binary matroid
zbMATH Keywords: edge swapping
zbMATH Keywords: fundamental circuit
MaRDI profile type: Publication
full work available at URL: s00186-012-0392-7
OpenAlex ID: W2006314097
cites work: Edge-swapping algorithms for the minimum fundamental cycle basis problem
cites work: Q3135082
DOI: 10.1007/S00186-012-0392-7
Recommended article: Q4737513
Recommended article: Edge reconstruction and the swapping number of a graph
Recommended article: Edge-swapping algorithms for the minimum fundamental cycle basis problem
Recommended article: On circuit exchange properties for matroids
Recommended article: Switching techniques for edge decompositions of graphs
Recommended article: A new exchange property for matroids and its application to max-min-problems
Recommended article: The Bipartite Swapping Trick on Graph Homomorphisms
Recommended article: On some algorithmic aspects of hypergraphic matroids
Recommended article: An exchange property of matroids
Recommended article: Q3818359
description: scientific article; zbMATH DE number 6137610