Skip to main navigation
Skip to search
Skip to main content
New Jersey Institute of Technology Home
Help & FAQ
Home
Profiles
Research units
Facilities
Federal Grants
Research output
Press/Media
Search by expertise, name or affiliation
Efficient parallel graph algorithms for multicore and multiprocessors
David A. Bader
, Guojing Cong
Research output
:
Chapter in Book/Report/Conference proceeding
›
Chapter
5
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Efficient parallel graph algorithms for multicore and multiprocessors'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Multicore
100%
Multiprocessor
100%
Parallel Graph Algorithms
100%
Graph Abstraction
100%
Cancer Detection
33%
Medical Imaging
33%
Security Applications
33%
National Security
33%
Engineering Problems
33%
Graph Problems
33%
Proteomics
33%
Combinatorial Problems
33%
Spanning Tree
33%
Gene Function
33%
Edge Weight
33%
Minimum Spanning Tree
33%
Wireless Communication Network
33%
Connected Graph
33%
Directed Edges
33%
Semantic Security
33%
Minimum Spanning Tree Problem
33%
VLSI Layout
33%
Wireless Distributed Network
33%
Bioterrorism
33%
Chemical Warfare
33%
Computer Science
Multicore
100%
multi-processor
100%
Minimum Spanning Tree
100%
Graph Algorithms
100%
Data Mining
50%
Wireless Communication
50%
Distributed Network
50%
Security Application
50%
Engineering Problem
50%
Medical Imaging
50%
Spanning Tree
50%
Combinatorial Problem
50%
Connected Graph
50%
semantic web application
50%