(algorithmic technique)
Definition: Technique for designing dynamic graph algorithms, which when applicable transform a time bound of T(n,m) onto O(T(n,n)), where m is the number of edges and n is the number of vertices of the given graph.
Note: From Algorithms and Theory of Computation Handbook, page 8-22, Copyright © 1999 by CRC Press LLC. Appearing in the Dictionary of Computer Science, Engineering and Technology, Copyright © 2000 CRC Press LLC.
Author: CRC-A
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 19 April 2004.
HTML page formatted Fri Mar 25 16:20:35 2011.
Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "sparsification", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 19 April 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/sparsificatn.html
