Counting Triangles under Updates in Worst-Case Optimal Time
From MaRDI portal
(Redirected from Publication:5091114)
Recommendations
- Approximately counting triangles in sublinear time
- An Optimal Algorithm for Triangle Counting in the Stream
- Computing and Combinatorics
- Efficiently enumerating minimal triangulations
- An efficient algorithm for enumeration of triangulations
- A second look at counting triangles in graph streams
- A second look at counting triangles in graph streams (corrected)
Cites work
- A second look at counting triangles in graph streams (corrected)
- Algorithmic aspects of parallel data processing
- Answering FO+MOD queries under updates on bounded degree databases
- Answering UCQs under updates and in the presence of integrity constraints
- Approximately counting triangles in sublinear time
- Computing and Combinatorics
- Finding and counting given length cycles
- scientific article; zbMATH DE number 2119719 (Why is no real title available?)
- The dynamic descriptive complexity of k-clique
- Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture
Cited in
(10)- Range updates and range sum queries on multidimensional points with monoid weights
- Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries
- On linear algebraic algorithms for the subgraph matching problem and its variants
- General space-time tradeoffs via relational queries
- Enumeration algorithms for conjunctive queries with projection
- Conjunctive queries with free access patterns under updates
- Towards optimal dynamic indexes for approximate (and exact) triangle counting
- Enumeration algorithms for conjunctive queries with projection
- Dynamic enumeration of similarity joins
- Tractable conjunctive queries over static and dynamic relations
This page was built for publication: Counting Triangles under Updates in Worst-Case Optimal Time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091114)
