Khuller, Samir2007-04-232007-04-231988-06http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR88-921https://hdl.handle.net/1813/6761Given a graph $G$, the closure of $G$ is the graph 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.626325 bytes255174 bytesapplication/pdfapplication/postscripten-UScomputer sciencetechnical reporttechnical report