Data Science2025

Graph Algorithms for the Red Scare Problem

Explored constrained pathfinding problems on graphs with designated "red" vertices, including alternating-color paths and red-count constraints.

Methodology

Applied BFS, Dijkstra's algorithm, and dynamic programming on DAGs, alongside computational complexity analysis.

Findings

Proved the generalized maximum-red-vertex problem is NP-hard via reduction from Hamiltonian s–t Path, establishing theoretical limits for efficient solutions.

Tools & Methods

Graph AlgorithmsPythonComplexity Analysis
Statistical Analysis of Housing Prices with Regularized RegressionAutomated Library Self-Service Infrastructure