Dynamic Vertex Triangle Listing

Preprocess an undirected graph G=(V,E)G = (V, E) such that, given a queried vertex uu, list all triangles that contain uu.

Parameters

  • nn: number of nodes
  • mm: number of edges

Related Problems

Insufficient data to display graph

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Insuffient Data to display table

Reductions Table

Displaying 2 of 2 reductions

Other relevant algorithms

Insuffient Data to display table