Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference50 articles.
1. Improved Time Bounds for the Maximum Flow Problem;Ahuja,1987
2. Retracts of hypercubes;Bandelt;J. Graph Thery,1984
3. A fixed cube theorem for median graphs;Bandelt;Discr. Math.,1987
4. A linear time approximation algorithm for the weighted vertex cover problem;Bar-Yehuda;J. Algorithms,1981
5. Dynamic search in graphs;Chung;Discrete Algorithms Complexity,1987
Cited by
71 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Adapting stable matchings to forced and forbidden pairs;Journal of Computer and System Sciences;2025-02
2. Maximum Matchings and Popularity;SIAM Journal on Discrete Mathematics;2024-04-04
3. Structural and Algorithmic Results for Stable Cycles and Partitions in the Roommates Problem;Lecture Notes in Computer Science;2024
4. FORM: Finding the Fair-Optimal Ridesharing Matching on Road Networks;2023 8th International Conference on Communication, Image and Signal Processing (CCISP);2023-11-17
5. Maximizing truck platooning participation with preferences;Transportation Research Part E: Logistics and Transportation Review;2023-11