Skip to main content
Book ChapterOPEN ACCESS

Online matching in regular bipartite graphs with randomized adversary

Springer Verlag, (2018), 297-310
DOI: 10.1007/978-3-319-98355-4_17
0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper deals with the problem of finding matchings in bipartite regular graphs in the online model with randomized adversary. We determine the competitive ratio for 2-regular graphs for any number of random decisions made by the adversary. We also give upper and lower bounds for other values of the degree.

Cite

CITATION STYLE

APA

Fàbrega, J., & Muñoz, X. (2018). Online matching in regular bipartite graphs with randomized adversary. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11011 LNCS, pp. 297–310). Springer Verlag. https://doi.org/10.1007/978-3-319-98355-4_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free