scientific article; zbMATH DE number 3997175

MaRDI QIDQ4723312zbMATH OpenFDO

Authors Ocatv Brudaru

Publication date 1985

zbMATH Keywords

acyclic digraphbacktrack algorithmparallel algorithm

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Parallel algorithms for partitioning sorted sets and related problems
• Parallel algorithms for partitioning sorted sets and related problems
• Parallelizing a new algorithm for the set partition problem
• Parallel algorithms for maximal acyclic sets
• A branch-and-bound algorithm for the acyclic partitioning problem
• An efficient parallel algorithm for the single function coarsest partition problem
• scientific article; zbMATH DE number 177834
• A parallel graph partitioning algorithm for a message-passing multiprocessor
• Parallel multilevel algorithms for hypergraph partitioning

Cited in

(4)

• Parallel algorithms for partitioning sorted sets and related problems
• Scalable heuristic algorithms for the parallel execution of data flow acyclic digraphs
• A branch-and-bound algorithm for the acyclic partitioning problem
• Graph partitioning with acyclicity constraints

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 Q4723312)