scientific article; zbMATH DE number 1057772

MaRDI QIDQ4352827zbMATH OpenFDO

Authors Tsan-sheng Hsu, Vijaya Ramachandran, Nathaniel Dean

Publication date 4 September 1997

zbMATH Keywords

fine-tuning techniquesparallel graph algorithms

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Graph algorithms (graph-theoretic aspects) (05C85) Software, source code, etc. for problems pertaining to computer science (68-04) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 1844551
• scientific article; zbMATH DE number 1057773
• scientific article; zbMATH DE number 3930349
• Efficient massively parallel implementation of some combinatorial algorithms

Cited in

(14)

• Efficient massively parallel implementation of some combinatorial algorithms
• A faster parallel connectivity algorithm on cographs
• A faster parallel algorithm for k-connectivity
• scientific article; zbMATH DE number 6708339 (Why is no real title available?)
• An efficient and fast parallel-connected component algorithm
• An Efficient Parallel Biconnectivity Algorithm
• scientific article; zbMATH DE number 3930349 (Why is no real title available?)
• scientific article; zbMATH DE number 4065021 (Why is no real title available?)
• Parallel algorithms for connectivity problems in graph theory
• Parallel Complexity of the Connected Subgraph Problem
• PARALLEL INCREMENTAL ALGORITHMS FOR ANALYZING ACTIVITY NETWORKS
• scientific article; zbMATH DE number 1102788 (Why is no real title available?)
• scientific article; zbMATH DE number 1844551 (Why is no real title available?)
• scientific article; zbMATH DE number 5879017 (Why is no real title available?)

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