Testing popularity in linear time via maximum matching

DOI10.1016/J.DAM.2025.01.014MaRDI QIDQ7021389zbMATH OpenFDO

Authors Erika R. Bérczi-Kovács, Kata Kosztolányi

Publication date 28 February 2025

Published in Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

linear-time algorithmpopular matchingpopularity testing

Mathematics Subject Classification ID

Linear programming (90C05) Graph algorithms (graph-theoretic aspects) (05C85) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

This page was built for publication: Testing popularity in linear time via maximum matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7021389)