Finding a long directed cycle

DOI10.1145/1328911.1328918zbMath1445.05102OpenAlexW2058198905MaRDI QIDQ4962699

Shuxin Nie, Harold N. Gabow

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1328911.1328918

zbMATH Keywords

Hamiltonian cyclescircumferenceapproximation algorithmslong cycles

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Directed graphs (digraphs), tournaments (05C20)

Related Items (7)

A randomized algorithm for long directed cycle ⋮ Inapproximability of shortest paths on perfect matching polytopes ⋮ Going Far from Degeneracy ⋮ Finding a subdivision of a digraph ⋮ Unnamed Item ⋮ Long directed \((s,t)\)-path: FPT algorithm ⋮ On the complexity of algorithms for detecting \(k\)-length negative cost cycles

This page was built for publication: Finding a long directed cycle