Improved algorithms for even factors and square-free simple \(b\)-matchings
type: Item
instance of: scholarly article
title: Improved algorithms for even factors and square-free simple \(b\)-matchings
zbMATH Open document ID: 1257.05050
author: Maxim Babenko
published in: Algorithmica
publication date: 2013-01-28T00:00:00Z
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 6131857
zbMATH Keywords: even factors
zbMATH Keywords: odd-cycle symmetric graphs
zbMATH Keywords: square-free simple \(b\)-matchings
zbMATH Keywords: alternating paths
MaRDI profile type: Publication
full work available at URL: s00453-012-9642-6
OpenAlex ID: W2127316372
cites work: A Faster Algorithm for the Maximum Even Factor Problem
cites work: The perfectly matchable subgraph polytope of an arbitrary graph
cites work: Introduction to algorithms
cites work: Matching, matroids, and extensions
cites work: The optimal path-matching problem
cites work: Finding maximum square-free 2-matchings in bipartite graphs
cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
cites work: The Independent Even Factor Problem
cites work: Even factors, jump systems, and discrete convexity
cites work: A Combinatorial Algorithm to Find a Maximum Even Factor
cites work: Combinatorial algorithms for matchings, even factors and square-free 2-factors
cites work: On the maximum even factor in weakly symmetric graphs
cites work: Q4737513
cites work: A weighted even factor algorithm
cites work: Q3707420
DOI: 10.1007/S00453-012-9642-6
description: scientific article; zbMATH DE number 6131857