An algorithm for finding a maximum -matching excluding complete partite subgraphs
Authors:
- Yusuke KobayashiYKYusuke Kobayashi
- Xin YinXYXin Yin
- 1 May 2012
- journal article
- Published by Elsevier in Discrete Optimization
- Vol. 9 (2) , 98-108
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Augmenting Undirected Node-Connectivity by OneSIAM Journal on Discrete Mathematics, 2011
- A simple algorithm for finding a maximum triangle-free -matching in subcubic graphsDiscrete Optimization, 2010
- A Weighted kt, t-Free t-Factor Algorithm for Bipartite GraphsMathematics of Operations Research, 2009
- Even factors, jump systems, and discrete convexityJournal of Combinatorial Theory, Series B, 2009
- On Maximum Cost $K_{t,t}$‐Free t‐Matchings of Bipartite GraphsSIAM Journal on Discrete Mathematics, 2007
- Combinatorial algorithms for matchings, even factors and square-free 2-factorsMathematical Programming, 2006
- Finding maximum square-free 2-matchings in bipartite graphsJournal of Combinatorial Theory, Series B, 2006
- Restricted t-matchings in bipartite graphsDiscrete Applied Mathematics, 2003
- A matching problem with side conditionsDiscrete Mathematics, 1980