Approximating the Longest Cycle Problem in Sparse Graphs
type: Item
instance of: scholarly article
title: Approximating the Longest Cycle Problem in Sparse Graphs
zbMATH Open document ID: 1041.68069
DOI: 10.1137/S0097539701395486
author: Carlos Subi
author: Tomás Feder
author: Rajeev Motwani
published in: SIAM Journal on Computing
publication date: 2002-09-29T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 1808492
zbMATH Keywords: long paths and cycles
zbMATH Keywords: Hamiltonian graphs
zbMATH Keywords: approximation algorithms
MaRDI profile type: Publication
full work available at URL: s0097539701395486
OpenAlex ID: W2028363565
Recommended article: Computing and Combinatorics
Recommended article: Approximating Longest Cycles in Graphs with Bounded Degrees
Recommended article: Cycle lengths in sparse graphs
Recommended article: An approximation algorithm for the longest cycle problem in solid grid graphs
Recommended article: Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs
Recommended article: Efficient approximation algorithms for shortest cycles in undirected graphs
Recommended article: Longest cycles in sparse random digraphs
Recommended article: Q4607968
Recommended article: Automata, Languages and Programming
Recommended article: Listing all fixed-length simple cycles in sparse graphs in optimal time
description: scientific article