Vertex Triangle Listing

Given an undirected graph $G = (V, E)$ , compute for every vertex $v\in V$ the set of triangles in $G$ which contain $v$ .

Parameters

$n$ : number of nodes
$m$ : number of edges

Related Problems

Edge Triangle Detection

Edge Triangle Counting

Vertex Triangle Listing

Dynamic Vertex Triangle Listing

Triangle Collection

All-Color-Pairs Triangle Collection*

All-Color-Pairs Triangle Collection

$\Delta$ -Matching Triangles

Minimum Weight Triangle

Combinatorial Triangle Detection

Insufficient data to display graph

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Insuffient Data to display table

Reductions Table

Insuffient Data to display table

Other relevant algorithms

Insuffient Data to display table