Abstract
Consider the problem of maintaining a family F of dynamic sets subject to insertions, deletions, and set-intersection reporting queries: given S, S′ ∈ F, report every member of S ∩S′ in any order. We show that in the word RAM model, where w is the word size, given a cap d on the maximum size of any set, we can support set intersection queries in O(Equation found) expected time, and updates in O(1) expected time. Using this algorithm we can list all t triangles of a graph G = (V, E) in O(Equation found) expected time, where m = |E| and α is the arboricity of G. This improves a 30-year old triangle enumeration algorithm of Chiba and Nishizeki running in O(mα) time. We provide an incremental data structure on F that supports intersection witness queries, where we only need to find one e ∈ S ∩ S′. Both queries and insertions take O (Equation found) expected time, where N = ΣS ∈F |S|. Finally, we provide time/space tradeoffs for the fully dynamic set intersection reporting problem. Using M words of space, each update costs O(√M logN) expected time, each reporting query costs O(Equation found) expected time where op is the size of the output, and each witness query costs O(Equation found) expected time.
Original language | English |
---|---|
Title of host publication | Algorithms and Data Structures - 14th International Symposium, WADS 2015, Proceedings |
Editors | Frank Dehne, Jorg-Rudiger Sack, Ulrike Stege |
Publisher | Springer Verlag |
Pages | 470-481 |
Number of pages | 12 |
ISBN (Print) | 9783319218397 |
DOIs | |
State | Published - 2015 |
Event | 14th International Symposium on Algorithms and Data Structures, WADS 2015 - Victoria, Canada Duration: 5 Aug 2015 → 7 Aug 2015 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 9214 |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 14th International Symposium on Algorithms and Data Structures, WADS 2015 |
---|---|
Country/Territory | Canada |
City | Victoria |
Period | 5/08/15 → 7/08/15 |
Bibliographical note
Publisher Copyright:© Springer International Publishing Switzerland 2015.
Funding
A more detailed version of this paper appears in []. Supported by NSF grants CCF-1217338 and CNS-1318294 and a grant from the US-Israel Binational Science Foundation. This research was performed in part at the Center for Massive Data Algorithmics (MADALGO) at Aarhus University, which is supported by the Danish National Research Foundation grant DNRF84.
Funders | Funder number |
---|---|
Center for Massive Data Algorithmics | |
National Science Foundation | |
National Science Foundation | CCF-1217338, CNS-1318294 |
Danmarks Grundforskningsfond | DNRF84 |
United States-Israel Binational Science Foundation |