Reference no: EM133221018
Analysis of Computer Algorithms
Project Topic:
The goal of this project is to gain hands-on experience in analyzing and designing computer algorithms and then evaluating them using real-world benchmarks and applications.
This project focuses on graph algorithms in terms of theoretic analysis, high- performance computing, and real-world applications. Graph is a natural representation for many real-world applications, such as road map, protein-protein interaction network, and code graph. The graph algorithms can help mine useful knowledge from the corresponding graphs, such as navigation on road map graph and vulnerability detection from code graphs.
A number of interesting graph algorithms along with its representative reference are provided below. You can freely choose one of them for your project. You can also choose other graph-related topics with a clear explanation in the initial project report.
Topics
Triangle Counting
K-Truss
Subgraph Matching
Random Walk
Articulation Point
Betweenness Centrality
BiConnected Component
Breadth-First Search
Community Detection
Connected Component
Depth-First Search
Frequent Subgraph Mining
Graph Coloring
Graph Reachability
Graph Summarization
Lowest Common Ancestor
Single-Source Shortest Path
Strongly Connected Component
(I) Submit your project planning report through canvas by the due date.
(2) Each team member MUST submit a copy through his/her account to receive a grade. Mention your teammate's name in the report,
(3) Your project planning report should include the motivation, background, your implementation and evaluation plan, any further improvement/optimization plan beyond current state of the art (optional), major milestones. references. Please keel:, your raPCNI within 2 pages.
Attachment:- Analysis of Computer Algorithms.rar