Push-relabel based algorithms for the maximum transversal problem

DOI10.1016/j.cor.2012.12.009zbMath1352.05176OpenAlexW2101079780MaRDI QIDQ502434

Johannes Langguth, Kamer Kaya, Fredrik Manne, Bora Uçar

Publication date: 5 January 2017

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2012.12.009

zbMATH Keywords

matchinggraph theorybipartite graphspush-relabel-based algorithms

Mathematics Subject Classification ID

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

Related Items (2)

Unnamed Item ⋮ A Distributed-Memory Algorithm for Computing a Heavy-Weight Perfect Matching on Bipartite Graphs

This page was built for publication: Push-relabel based algorithms for the maximum transversal problem