„triangle counting“

Suchergebnisse

1.000+ Treffer

• New deterministic algorithms for counting pairs of intersecting segments and off line triangle range searching
  Pellegrini, Marco 1995 MPI Informatik, Bibliothek & Dokumentation
• Some counting problems in graphs
  Mohr, Elena 2021 Universität Ulm
• Streaming algorithms for triangle counting: adversarial robustness and the weighted case
  Cao, Jing ; Pan, Yicheng ; Peng, Pan
• Graph sparsification techniques for triangle counting
  Hermann, Matthias 2020 Universitätsbibliothek der Universität Stuttgart
• Triangle Counting in Dynamic Graph Streams
  Bulteau, Laurent ; Froese, Vincent ; Kutzkov, Konstantin ; Pagh, Rasmus
• Counting Triangles under Updates in Worst-Case Optimal Time
  Kara, Ahmet ; Ngo, Hung Q. ; Nikolic, Milos ; Olteanu, Dan ; Zhang, Haozhe 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Fast Approximate Counting of Cycles
  Censor-Hillel, Keren ; Even, Tomer ; Vassilevska Williams, Virginia 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Cycle Counting Under Local Differential Privacy for Degeneracy-Bounded Graphs
  Hillebrand, Quentin ; Suppakitpaisarn, Vorapong ; Shibuya, Tetsuo 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On the Complexity of Triangle Counting Using Emptiness Queries
  Bishnu, Arijit ; Ghosh, Arijit ; Mishra, Gopinath 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Triangle Counting with Local Edge Differential Privacy
  Eden, Talya ; Liu, Quanquan C. ; Raskhodnikova, Sofya ; Smith, Adam 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Massively Parallel Algorithms for Small Subgraph Counting
  Biswas, Amartya Shankha ; Eden, Talya ; Liu, Quanquan C. ; Rubinfeld, Ronitt ; Mitrović, Slobodan 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Counting Simplices in Hypergraph Streams
  Chakrabarti, Amit ; Haris, Themistoklis 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Approximate Triangle Counting via Sampling and Fast Matrix Multiplication
  Tětek, Jakub 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• An Optimal Algorithm for Triangle Counting in the Stream
  Jayaram, Rajesh ; Kallaugher, John 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Towards Optimal Dynamic Indexes for Approximate (and Exact) Triangle Counting
  Lu, Shangqi ; Tao, Yufei 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Speeding up Networks Mining via Neighborhood Diversity
  Cordasco, Gennaro ; Gargano, Luisa ; Rescigno, Adele A. 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Towards Tighter Space Bounds for Counting Triangles and Other Substructures in Graph Streams
  Bera, Suman K. ; Chakrabarti, Amit 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Counting Circles Without Computing Them
  Fleischer, Rudolf 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On counting pairs of intersecting segments and off-line triangle range searching
  Pellegrini, M.
• Counting triangles in smooth cubic hypersurfaces
  Xu, Mulong