scientific article; zbMATH DE number 1534586

MaRDI QIDQ4517372zbMATH OpenFDO

Authors A. Sh. Nepomnyaschaya

Publication date 21 November 2000

zbMATH Keywords

associative parallel processorcombinatorial optimizationgraph theorySIMDSTARvertical data processing

Mathematics Subject Classification ID

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

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

Cited in

(2)

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

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)