• Faster graph algorithms via switching classes 

        Author(s):Lindzey, Nathan
        Date Issued:2012
        Format:born digital; masters theses
        The runtime of an algorithm is intimately related to how an instance is represented. Recall that the runtimes of the first generation of graph algorithms were expressed as functions of n := |V|. This analysis was natural ...