Matches in SemOpenAlex for { <https://semopenalex.org/work/W3136386498> ?p ?o ?g. }
Showing items 1 to 83 of
83
with 100 items per page.
- W3136386498 startingPage "23" @default.
- W3136386498 abstract "In ICDT'19, Kara, Ngo, Nikolic, Olteanu, and Zhang gave a structure which maintains the number T of triangles in an undirected graph G = (V, E) along with the edge insertions/deletions in G. Using O(m) space (m = |E|), their structure supports an update in O(√m log m) amortized time which is optimal (up to polylog factors) subject to the OMv-conjecture (Henzinger, Krinninger, Nanongkai, and Saranurak, STOC'15). Aiming to improve the update efficiency, we study: - the optimal tradeoff between update time and approximation quality. We require a structure to provide the (e, Γ)-guarantee: when queried, it should return an estimate t of T that has relative error at most e if T ≥ Γ, or an absolute error at most e ⋅ Γ, otherwise. We prove that, under any e ≤ 0.49 and subject to the OMv-conjecture, no structure can guarantee O(m^{0.5-δ}/Γ) expected amortized update time and O(m^{2/3-δ}) query time simultaneously for any constant δ > 0; this is true for Γ = m^c of any constant c in [0, 1/2). We match the lower bound with a structure that ensures O((1/e)³ ⋅ √m/Γ) amortized update time with high probability, and O(1) query time. - (for exact counting) how to achieve arboricity-sensitive update time. For any 1 ≤ Γ ≤ √m, we describe a structure of O(min{α m + m log m, (m/Γ)²}) space that maintains T precisely, and supports an update in O(min{α + Γ, √m}) amortized time, where α is the largest arboricity of G in history (and does not need to be known). Our structure reconstructs the aforementioned ICDT'19 result up to polylog factors by setting Γ = √m, but achieves O(m^{0.5-δ}) update time as long as α = O(m^{0.5-δ})." @default.
- W3136386498 created "2021-03-29" @default.
- W3136386498 creator A5048609852 @default.
- W3136386498 creator A5082947679 @default.
- W3136386498 date "2021-01-01" @default.
- W3136386498 modified "2023-09-24" @default.
- W3136386498 title "Towards Optimal Dynamic Indexes for Approximate (and Exact) Triangle Counting" @default.
- W3136386498 doi "https://doi.org/10.4230/lipics.icdt.2021.6" @default.
- W3136386498 hasPublicationYear "2021" @default.
- W3136386498 type Work @default.
- W3136386498 sameAs 3136386498 @default.
- W3136386498 citedByCount "2" @default.
- W3136386498 countsByYear W31363864982021 @default.
- W3136386498 countsByYear W31363864982022 @default.
- W3136386498 crossrefType "proceedings-article" @default.
- W3136386498 hasAuthorship W3136386498A5048609852 @default.
- W3136386498 hasAuthorship W3136386498A5082947679 @default.
- W3136386498 hasConcept C101837359 @default.
- W3136386498 hasConcept C111919701 @default.
- W3136386498 hasConcept C11413529 @default.
- W3136386498 hasConcept C114614502 @default.
- W3136386498 hasConcept C118615104 @default.
- W3136386498 hasConcept C132525143 @default.
- W3136386498 hasConcept C134306372 @default.
- W3136386498 hasConcept C142417499 @default.
- W3136386498 hasConcept C162319229 @default.
- W3136386498 hasConcept C199360897 @default.
- W3136386498 hasConcept C2777027219 @default.
- W3136386498 hasConcept C2778572836 @default.
- W3136386498 hasConcept C2780990831 @default.
- W3136386498 hasConcept C3017489831 @default.
- W3136386498 hasConcept C33923547 @default.
- W3136386498 hasConcept C41008148 @default.
- W3136386498 hasConcept C63553672 @default.
- W3136386498 hasConcept C77553402 @default.
- W3136386498 hasConcept C83204008 @default.
- W3136386498 hasConceptScore W3136386498C101837359 @default.
- W3136386498 hasConceptScore W3136386498C111919701 @default.
- W3136386498 hasConceptScore W3136386498C11413529 @default.
- W3136386498 hasConceptScore W3136386498C114614502 @default.
- W3136386498 hasConceptScore W3136386498C118615104 @default.
- W3136386498 hasConceptScore W3136386498C132525143 @default.
- W3136386498 hasConceptScore W3136386498C134306372 @default.
- W3136386498 hasConceptScore W3136386498C142417499 @default.
- W3136386498 hasConceptScore W3136386498C162319229 @default.
- W3136386498 hasConceptScore W3136386498C199360897 @default.
- W3136386498 hasConceptScore W3136386498C2777027219 @default.
- W3136386498 hasConceptScore W3136386498C2778572836 @default.
- W3136386498 hasConceptScore W3136386498C2780990831 @default.
- W3136386498 hasConceptScore W3136386498C3017489831 @default.
- W3136386498 hasConceptScore W3136386498C33923547 @default.
- W3136386498 hasConceptScore W3136386498C41008148 @default.
- W3136386498 hasConceptScore W3136386498C63553672 @default.
- W3136386498 hasConceptScore W3136386498C77553402 @default.
- W3136386498 hasConceptScore W3136386498C83204008 @default.
- W3136386498 hasLocation W31363864981 @default.
- W3136386498 hasOpenAccess W3136386498 @default.
- W3136386498 hasPrimaryLocation W31363864981 @default.
- W3136386498 hasRelatedWork W1447961680 @default.
- W3136386498 hasRelatedWork W1551891681 @default.
- W3136386498 hasRelatedWork W1579008745 @default.
- W3136386498 hasRelatedWork W172120053 @default.
- W3136386498 hasRelatedWork W2093455937 @default.
- W3136386498 hasRelatedWork W2178621981 @default.
- W3136386498 hasRelatedWork W2245158765 @default.
- W3136386498 hasRelatedWork W2958004992 @default.
- W3136386498 hasRelatedWork W2963424691 @default.
- W3136386498 hasRelatedWork W3008331007 @default.
- W3136386498 hasRelatedWork W3015309785 @default.
- W3136386498 hasRelatedWork W3073529507 @default.
- W3136386498 hasRelatedWork W3100139999 @default.
- W3136386498 hasRelatedWork W3102089556 @default.
- W3136386498 hasRelatedWork W3103340610 @default.
- W3136386498 hasRelatedWork W3129929010 @default.
- W3136386498 hasRelatedWork W3130010324 @default.
- W3136386498 hasRelatedWork W3170339516 @default.
- W3136386498 hasRelatedWork W3196348807 @default.
- W3136386498 hasRelatedWork W3202568496 @default.
- W3136386498 isParatext "false" @default.
- W3136386498 isRetracted "false" @default.
- W3136386498 magId "3136386498" @default.
- W3136386498 workType "article" @default.