Browsing Department of Computer Science by Title "Faster graph algorithms via switching classes"
Now showing items 1-1 of 1
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 ...