A Faster Algorithm for the Maximum Even Factor Problem

DOI10.1007/978-3-642-17517-6_40zbMath1311.05181arXiv1004.2115OpenAlexW2962762897MaRDI QIDQ3060755

Maxim A. Babenko

Publication date: 9 December 2010

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1004.2115

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Improved algorithms for even factors and square-free simple \(b\)-matchings

This page was built for publication: A Faster Algorithm for the Maximum Even Factor Problem