Liang, WeifaShen, XiaojunHu, Qing2015-12-132015-12-131206-2138http://hdl.handle.net/1885/91026Let G(V, E, w) be an undirected, weighted, connected simple graph. Let P be a minimization problem in G. Edge e*∈E is called the most vital edge if its removal from G maximizes the value of P in G(V, E-{e*}, w). This paper considers the most vital edgeKeywords: Computer simulation; Edge detection; Graph theory; Mathematical models; Parallel algorithms; Problem solving; Hypercube arrays; Mesh arrays; Parallel processing systems20002015-12-12