A parallel algorithm for approximating the minimum cycle cover
type: Item
instance of: scholarly article
title: A parallel algorithm for approximating the minimum cycle cover
zbMATH Open document ID: 0766.68048
DOI: 10.1007/BF01185336
author: Clifford Stein
author: Philip N. Klein
published in: Algorithmica
publication date: 1993-04-01T00:00:00Z
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 149505
zbMATH Keywords: parallel approximation algorithm
zbMATH Keywords: minimum cycle cover
MaRDI profile type: Publication
cites work: Covering Multigraphs by Simple Circuits
cites work: Q3941433
cites work: Using euler partitions to edge color bipartite multigraphs
cites work: Covering Graphs by Simple Circuits
cites work: Q4166786
cites work: A parallel algorithm for eliminating cycles in undirected graphs
cites work: A fast parallel algorithm for routing in permutation networks
cites work: Q3727398
cites work: On Finding Lowest Common Ancestors: Simplification and Parallelization
cites work: Nowhere-zero 6-flows
cites work: Edge-disjoint branching in directed multigraphs
cites work: A good algorithm for edge-disjoint branching
description: scientific article; zbMATH DE number 149505