Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs

Keyphrases

• Sparse Graphs 100%
• Minimum Spanning Tree 100%
• Minimum Spanning Forest 100%
• Shared Memory Algorithms 100%
• Regular Structure 66%
• Parallel Computing 33%
• Cancer Detection 33%
• Freely Available 33%
• Medical Imaging 33%
• Source Code 33%
• Proteomics 33%
• Bioterrorism 33%
• Random Graphs 33%
• National Security 33%
• Wireless Communication Network 33%
• Combinatorial Problems 33%
• Chemical Warfare 33%
• Symmetric multiprocessor 33%
• Special Graphs 33%
• Sequential Algorithm 33%
• Minimum Spanning Tree Algorithm 33%
• VLSI Layout 33%
• Irregular Structures 33%
• Enterprise Servers 33%
• Wireless Distributed Network 33%

Computer Science

• Minimum Spanning Tree 100%
• Shared Memory 100%
• Wireless Communication 25%
• Random Graphs 25%
• Distributed Network 25%
• Medical Imaging 25%
• Combinatorial Problem 25%
• Symmetric Multi-Processor 25%
• Sequential Algorithm 25%
• Spanning Tree Algorithm 25%
• Parallel Computer 25%

Mathematics

• Sparse Graphs 100%
• Minimum Spanning Tree 100%
• Edge 25%
• Wide Range 25%
• Combinatorial Problem 25%
• Random Graphs 25%