Finding the longest isometric cycle in a graph

DOI10.1016/j.dam.2008.08.008zbMath1211.05063OpenAlexW1979158362MaRDI QIDQ967311

Daniel Lokshtanov

Publication date: 28 April 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.08.008

zbMATH Keywords

polynomial time algorithmlongest cycleinduced cycleisometric cyclelongest isometric cycle

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (9)

On the minimum eccentricity isometric cycle problem ⋮ On the string consensus problem and the Manhattan sequence consensus problem ⋮ Improved bounds on the difference between the Szeged index and the Wiener index of graphs ⋮ Integer Programming in Parameterized Complexity: Three Miniatures. ⋮ Parameterized computational complexity of finding small-diameter subgraphs ⋮ To Approximate Treewidth, Use Treelength! ⋮ On Computing the Gromov Hyperbolicity ⋮ Unnamed Item ⋮ Decomposing a graph into shortest paths with bounded eccentricity

Cites Work

• Matrix multiplication via arithmetic progressions
• Reducibility Among Combinatorial Problems
• `` Strong NP-Completeness Results
• Unnamed Item

This page was built for publication: Finding the longest isometric cycle in a graph