A FAST ALGORITHM TO DETERMINE MINIMALITY OF STRONGLY CONNECTED DIGRAPHS by JIANPING ZHU ( Under the Direction of

Abstract

by JIANPING ZHU (Under the Direction of Robert W. Robinson) ABSTRACT In this thesis, we consider the following problem: Given a strongly connected digraph G = (V, E), where V is the set of vertices and E is the set of edges , “is it a minimal strong connected digraph?”. A reducible edges e is one for which G−e is strongly connected. A minimal strongly… (More)

Topics

  • Presentations referencing similar topics