Faster scaling algorithms for general graph matching problems
Journal of the ACM (JACM)
Pfaffian forms and &Dgr;-matroids
Discrete Mathematics
Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra
SIAM Journal on Discrete Mathematics
The membership problem in jump systems
Journal of Combinatorial Theory Series B - Special issue: dedicated to Professor W. T. Tutte on the occasion of his eightieth birthday
Data structures for weighted matching and nearest common ancestors with linking
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Discrete Convex Analysis: Monographs on Discrete Mathematics and Applications 10
Discrete Convex Analysis: Monographs on Discrete Mathematics and Applications 10
Restricted t-matchings in bipartite graphs
Discrete Applied Mathematics - Submodularity
M-Convex Functions on Jump Systems: A General Framework for Minsquare Graph Factor Problem
SIAM Journal on Discrete Mathematics
Finding maximum square-free 2-matchings in bipartite graphs
Journal of Combinatorial Theory Series B
A Steepest Descent Algorithm for M-Convex Functions on Jump Systems
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Combinatorial algorithms for matchings, even factors and square-free 2-factors
Mathematical Programming: Series A and B
Operations on M-Convex Functions on Jump Systems
SIAM Journal on Discrete Mathematics
On Maximum Cost $K_{t,t}$-Free $t$-Matchings of Bipartite Graphs
SIAM Journal on Discrete Mathematics
Polynomial-Time Algorithms for Linear and Convex Optimization on Jump Systems
SIAM Journal on Discrete Mathematics
Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract)
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Even factors, jump systems, and discrete convexity
Journal of Combinatorial Theory Series B
A Weighted kt, t-Free t-Factor Algorithm for Bipartite Graphs
Mathematics of Operations Research
A proof of Cunningham's conjecture on restricted subgraphs and jump systems
Journal of Combinatorial Theory Series B
| Hi-index | 0.00 |
In this paper, we consider the problem of finding a maximum weight 2-matching containing no cycle of a length of at most three in a weighted simple graph, which we call the weighted triangle-free 2-matching problem. Although the polynomial solvability of this problem is still open in general graphs, a polynomial-time algorithm is given by Hartvigsen and Li for the problem in subcubic graphs, i.e., graphs with a maximum degree of at most three. Our contribution is to provide another polynomial-time algorithm for the weighted triangle-free 2-matching problem in subcubic graphs. Our algorithm consists of two basic algorithms: a steepest ascent algorithm and a classical maximum weight2-matching algorithm, and is justified by fundamental results from the theory of discrete convex functions on jump systems.