Push-relabel based algorithms for the maximum transversal problem-Reference-Cited by-同舟云学术

Push-relabel based algorithms for the maximum transversal problem

Published:2013-05 Issue:5 Volume:40 Page:1266-1275
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

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

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modeling and Simulation,General Computer Science

Reference31 articles.

1. An n5/2 algorithm for maximum matchings in bipartite graphs;Hopcroft;SIAM Journal on Computing,1973

2. Computing a maximum cardinality matching in a bipartite graph in time O(n1.5m/logn);Alt;Information Processing Letters,1991

3. Timmer AH, Jess JAG. Exact scheduling strategies based on bipartite graph matching. In: Proceedings of the 1995 European conference on design and test, EDTC '95, IEEE Computer Society, Washington, DC, USA; 1995. pp. 42–7.

4. Lewandowski G. Course scheduling: metrics, models, and methods; 1996.

5. Lewandowski G, Ojha P, Rizzo J, Walker A. An average case approximation bound for course scheduling by greedy bipartite matching. In: Proceedings of the 4th international conference on the practice and theory of automated timetabling; 2002. p. 144–7.

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Genetic Algorithm for Optimization of Heating Networks;2022 VI International Conference on Information Technologies in Engineering Education (Inforino);2022-04-12

2. Shared-memory implementation of the Karp-Sipser kernelization process;2021 IEEE 28th International Conference on High Performance Computing, Data, and Analytics (HiPC);2021-12

3. A Distributed-Memory Algorithm for Computing a Heavy-Weight Perfect Matching on Bipartite Graphs;SIAM Journal on Scientific Computing;2020-01

4. Computing Maximum Cardinality Matchings in Parallel on Bipartite Graphs via Tree-Grafting;IEEE Transactions on Parallel and Distributed Systems;2017-01-01

5. A matrix-algebraic formulation of distributed-memory maximal cardinality matching algorithms in bipartite graphs;Parallel Computing;2016-10