A parallel algorithm for approximating the minimum cycle cover

This publication has 16 references indexed in Scilit:

• A parallel algorithm for eliminating cycles in undirected graphs
  Information Processing Letters, 1990
• Approximate and exact parallel scheduling with applications to list, tree and graph problems
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1986
• Parallel ear decomposition search (EDS) and st-numbering in graphs
  Published by Springer Nature ,1986
• Covering Multigraphs by Simple Circuits
  SIAM Journal on Algebraic Discrete Methods, 1985
• Computing ears and branchings in parallel
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1985
• Finding euler circuits in logarithmic parallel time
  Published by Association for Computing Machinery (ACM) ,1984
• Covering Graphs by Simple Circuits
  SIAM Journal on Computing, 1981
• A fast parallel algorithm for routing in permutation networks
  IEEE Transactions on Computers, 1981
• Covering a graph by circuits
  Published by Springer Nature ,1978
• Using euler partitions to edge color bipartite multigraphs
  International Journal of Parallel Programming, 1976