@inproceedings{97669d34c420475d93c4476bcebcf338,

title = "Maintaining a large matching and a small vertex cover",

abstract = "We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge insertion. We give the first randomized data structure that simultaneously achieves a constant approximation factor and handles a sequence of K updates in K·polylog(n) time, where n is the number of vertices in the graph. Previous data structures require a polynomial amount of computation per update.",

keywords = "data structures, dynamic algorithms, maximum matching, vertex cover",

author = "Krzysztof Onak and Ronitt Rubinfeld",

year = "2010",

doi = "10.1145/1806689.1806753",

language = "אנגלית",

isbn = "9781605588179",

series = "Proceedings of the Annual ACM Symposium on Theory of Computing",

pages = "457--464",

booktitle = "STOC'10 - Proceedings of the 2010 ACM International Symposium on Theory of Computing",

note = "42nd ACM Symposium on Theory of Computing, STOC 2010 ; Conference date: 05-06-2010 Through 08-06-2010",

}