Design, implementation, and analysis of maximum transversal algorithms

@article{Duff2012DesignIA,
  title={Design, implementation, and analysis of maximum transversal algorithms},
  author={Iain S. Duff and Kamer Kaya and Bora Uçar},
  journal={ACM Trans. Math. Softw.},
  year={2012},
  volume={38},
  pages={13:1-13:31}
}
  • Iain S. Duff, Kamer Kaya, Bora Uçar
  • Published 2012
  • Computer Science, Mathematics
  • ACM Trans. Math. Softw.
  • We report on careful implementations of seven algorithms for solving the problem of finding a maximum transversal of a sparse matrix. We analyze the algorithms and discuss the design choices. To the best of our knowledge, this is the most comprehensive comparison of maximum transversal algorithms based on augmenting paths. Previous papers with the same objective either do not have all the algorithms discussed in this article or they used nonuniform implementations from different researchers. We… CONTINUE READING

    Figures, Tables, and Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 39 CITATIONS, ESTIMATED 98% COVERAGE

    Multithreaded Algorithms for Maximum Matching in Bipartite Graphs

    VIEW 4 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    A Push-Relabel-Based Maximum Cardinality Bipartite Matching Algorithm on GPUs

    VIEW 2 EXCERPTS
    CITES BACKGROUND & METHODS

    FILTER CITATIONS BY YEAR

    2011
    2020

    CITATION STATISTICS

    • 3 Highly Influenced Citations

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 14 REFERENCES

    Heuristic initialization for bipartite matching problems

    VIEW 14 EXCERPTS
    HIGHLY INFLUENTIAL

    Greeding matching algorithms, an experimental study

    VIEW 12 EXCERPTS
    HIGHLY INFLUENTIAL

    Matching Algorithms Are Fast in Sparse Random Graphs

    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    LEDA: a platform for combinatorial and geometric computing

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    TWO THEOREMS IN GRAPH THEORY.

    • Ch. Berge
    • Computer Science, Medicine
    • Proceedings of the National Academy of Sciences of the United States of America
    • 1957
    VIEW 1 EXCERPT
    HIGHLY INFLUENTIAL

    A competitive (dual) simplex method for the assignment problem

    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL

    An n5/2 Algorithm for Maximum Matchings in Bipartite Graphs

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Maximum matching in sparse random graphs

    • R. M. Karp, Michael Sipser
    • Mathematics, Computer Science
    • 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)
    • 1981
    VIEW 11 EXCERPTS
    HIGHLY INFLUENTIAL