Michael P. Verdicchio

For my semester project in my algorithms class I implemented an articulation point detection algorithm by Harold Gabow. Articulation points, a.k.a. cut vertices, are vertices in an undirected graph which, when removed, break the graph into components. The stack-based algorithm is a version of Robert Tarjan’s LOWPOINT method, and it runs in roughly O(|V|*|E|). I picked it for my project since I’d eventually like to apply articulation point detection to gene regulatory network studies. I’ve posted the report, the software, sample input/output, and source code on my website: http://www.michaelverdicchio.com/articulation.