An algorithm for finding a maximum \(t\)-matching excluding complete partite subgraphs
type: Item
instance of: scholarly article
title: An algorithm for finding a maximum \(t\)-matching excluding complete partite subgraphs
zbMATH Open document ID: 1246.05150
author: Yusuke Kobayashi
author: Xin Yin
published in: Discrete Optimization
publication date: 2012-09-11T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6080922
zbMATH Keywords: b-matching
zbMATH Keywords: complete partite graph
zbMATH Keywords: polynomial-time algorithm
zbMATH Keywords: shrinking
MaRDI profile type: Publication
full work available at URL: j.disopt.2012.02.003
OpenAlex ID: W2046239121
cites work: A matching problem with side conditions
cites work: Finding maximum square-free 2-matchings in bipartite graphs
cites work: Combinatorial algorithms for matchings, even factors and square-free 2-factors
cites work: Restricted b-Matchings in Degree-Bounded Graphs
cites work: Augmenting Undirected Node-Connectivity by One
cites work: Restricted \(t\)-matchings in bipartite graphs
cites work: On Maximum Cost $K_{t,t}$‐Free t‐Matchings of Bipartite Graphs
cites work: A Weighted kt, t-Free t-Factor Algorithm for Bipartite Graphs
cites work: A simple algorithm for finding a maximum triangle-free \(2\)-matching in subcubic graphs
cites work: Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract)
cites work: Even factors, jump systems, and discrete convexity
DOI: 10.1016/J.DISOPT.2012.02.003
description: scientific article; zbMATH DE number 6080922