Title: Ultra-dense Graph Representations
Project ID: QFmfS27
Domain(s): Systems Engineering,Cybersecurity


Many critical problems in national security, cybersecurity, and beyond can be best represented by graphs. While there is growing number graph databases that can scale linearly they are largely focused on queries over the graph. Scaling graphs is a challenge when the objective is to run arbitrary algorithms at very large scale. Supercomputer graph systems exist but they require exotic hardware. This proposal seeks novel ultra-dense data representation designs to store/computer over graphs using the large memory machines now available in Amazon AWS or Google cloud to enable very large graphs on single machines and affordably compute on them.

Desired Skills:
Computer Science with a focus on data structures and algorithms.


US Citizenship Required: No
Active Clearance or Background Investigation Required: No
Level Needed:

Team Information-

Targeted Students: Grad
Team Size: 2 to 4
Details: Ideal team size is likely 2 students to leverage different perspectives and experiences.

Specific Requirements-

Focus on Particular University: Yes
Details: George Mason University, Virginia Tech


Focus Timeline: No


Potential Funding:No
Note: Availability of funds not guaranteed

I’m Interested In this Project