Design, implementation, and analysis of maximum transversal algorithms

DOI10.1145/2049673.2049677zbMath1365.65124OpenAlexW2104332310WikidataQ113310418 ScholiaQ113310418MaRDI QIDQ2989152

Kamer Kaya, Bora Uçcar, Iain S. Duff

Publication date: 19 May 2017

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: http://purl.org/net/epubs/work/54399

zbMATH Keywords

matchinggraph theorybipartite graphsassignmentbreadth first searchdepth first searchmatrix transversals

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Unnamed Item ⋮ A Distributed-Memory Algorithm for Computing a Heavy-Weight Perfect Matching on Bipartite Graphs ⋮ A 2/3-Approximation Algorithm for Vertex Weighted Matching in Bipartite Graphs ⋮ A survey of direct methods for sparse linear systems ⋮ Approximation algorithms in combinatorial scientific computing

This page was built for publication: Design, implementation, and analysis of maximum transversal algorithms