scientific article; zbMATH DE number 1534586

zbMATH Open0951.68184MaRDI QIDQ4517372FDOQ4517372

Authors: A. Sh. Nepomnyaschaya 

Publication date: 21 November 2000

Title of this publication is not available (Why is that?)

Recommendations

• Constructions used in associative parallel algorithms for undirected graphs. I
• A parallel algorithm for eliminating cycles in undirected graphs
• Effective search for all maximal mean cycles in a graph
• Algorithms for finding the minimum cycle mean in the weighted directed graph
• scientific article; zbMATH DE number 1830934

zbMATH Keywords

combinatorial optimizationgraph theorySTARassociative parallel processorSIMDvertical data processing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Parallel algorithms in computer science (68W10)

Cited In (2)

• Effective search for all maximal mean cycles in a graph
• Approximating maximum weight cycle covers in directed graphs with weights zero and one

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4517372)