{"id":"2406.07630","title":"Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS","url":"https://codeofpaper.com/paper/2406.07630","arxiv_url":"https://arxiv.org/abs/2406.07630","published":"2024-06-01","code":"community","best":{"full_name":"mohammadroghani/Tight-Analysis-of-EDCS","url":"https://github.com/mohammadroghani/Tight-Analysis-of-EDCS","tier":"high_confidence_community","stars":0,"license":"MIT","framework":null,"language":"Python","last_commit":"2024-05-31T17:18:11"},"most_starred_community":null,"implementations":[{"full_name":"mohammadroghani/Tight-Analysis-of-EDCS","url":"https://github.com/mohammadroghani/Tight-Analysis-of-EDCS","tier":"high_confidence_community","stars":0,"license":"MIT","framework":null,"language":"Python","last_commit":"2024-05-31T17:18:11"}],"possible_matches":0}