Edge Triangle Detection

Given an undirected graph G=(V,E)G = (V, E), determine for every edge e∈Ee\in E whether there is a triangle in GG which contains ee.

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 7 of 7 reductions

Other relevant algorithms

Insuffient Data to display table