A fast scaling algorithm for the weighted triangle-free 2-matching problem
type: Item
instance of: scholarly article
title: A fast scaling algorithm for the weighted triangle-free 2-matching problem
zbMATH Open document ID: 1373.05146
author: Peng Zhang
published in: European Journal of Combinatorics
publication date: 2017-11-14T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 6806761
zbMATH Keywords: triangle cluster
zbMATH Keywords: polynomial algorithm
zbMATH Keywords: perfect triangle-free 2-matching
MaRDI profile type: Publication
full work available at URL: j.ejc.2017.07.008
OpenAlex ID: W2756272112
cites work: A Fast Scaling Algorithm for the Weighted Triangle-Free 2-Matching Problem
cites work: TRIANGLE-FREE 2-MATCHINGS REVISITED
cites work: A matching problem with side conditions
cites work: Perfect triangle-free 2-matchings
cites work: Maximum matching and a polyhedron with 0,1-vertices
cites work: Clique partitions, graph compression and speeding-up algorithms
cites work: Faster Scaling Algorithms for Network Problems
cites work: Faster scaling algorithms for general graph matching problems
cites work: Maximum skew-symmetric flows and matchings
cites work: Q4234100
cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
cites work: Triangle-free 2-matchings and M-concave functions on jump systems
cites work: A data structure for dynamic trees
DOI: 10.1016/J.EJC.2017.07.008
description: scientific article; zbMATH DE number 6806761