Shortest k-Cycle

Given a graph G=(V,E)G=(V,E) with non-negative weights, find a minimum weight cycle of length kk.

Parameters

  • nn: number of vertices
  • mm: number of edges
  • kk: length of cycle

Related Problems

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