This encyclopedia provides a comprehensive set of solutions to important algorithmic problems. Focusing on high-impact solutions from the most recent decade, each entry will include a description of the problem, input and output specifications, key results, examples of applications and citations to key literature.ACM J. Exp. Algorithmics 2 (1997) 2. Beame, P., Fich, F.E.: Optimal bounds for the predecessor problem and related problems. J. Comp. Syst. Sci. ... Frederickson, G.N.: Ambivalent data structures for dynamic 2- edge- connectivityandk smallestspanningtrees.In:Proc.32nd Symp. ... 1 is called a bridge. The following theorem due to Ford and Fulkerson, and Elias, Fully Dynamic Higher Connectivity 335 F.
|Title||:||Encyclopedia of Algorithms|
|Publisher||:||Springer Science & Business Media - 2008-08-06|