A Fast Scaling Algorithm for the Weighted Triangle-Free 2-Matching Problem
From MaRDI portal
Publication:2798214
DOI10.1007/978-3-319-29516-9_3zbMath1417.05158OpenAlexW2338909670MaRDI QIDQ2798214
Stepan Artamonov, Maxim A. Babenko
Publication date: 4 April 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-29516-9_3
Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (2)
A fast scaling algorithm for the weighted triangle-free 2-matching problem ⋮ Application of non-associative structures for construction of homomorphic cryptosystems
This page was built for publication: A Fast Scaling Algorithm for the Weighted Triangle-Free 2-Matching Problem
