@article {15198,
	title = {On computing graph closures},
	journal = {Information Processing Letters},
	volume = {31},
	year = {1989},
	month = {1989/06/12/},
	pages = {249 - 255},
	abstract = {The closure of a graph G of n vertices is obtained from G by recursively joining pairs of non-adjacent vertices whose degree sum is at least n until no such pair remains. We give an efficient algorithm to compute the closure using F-heaps. We also define the general closure of a graph and show that computing the general closure is P-complete with respect to log-space transformations.},
	keywords = {closure, graphs, P-completeness},
	isbn = {0020-0190},
	doi = {10.1016/0020-0190(89)90082-3},
	url = {http://www.sciencedirect.com/science/article/pii/0020019089900823},
	author = {Khuller, Samir}
}
