Finding the longest isometric cycle in a graph

  • Authors:

  • Daniel Lokshtanov

  • Affiliations:

  • Department of Informatics, University of Bergen, N-5020 Bergen, Norway

  • Venue:
  • Discrete Applied Mathematics
  • Year:
  • 2009

Quantified Score

Hi-index 0.04

Visualization

Abstract

A cycle in a graph G is isometric if the distance between two vertices in the cycle is equal to their distance in G. Finding the longest isometric cycle of a graph is then a natural variant of the problem of finding a longest cycle. While most variants of the longest cycle problem are NP-complete, we show that quite surprisingly, one can find a longest isometric cycle in a graph in polynomial time.