On Computing Graph Closures
| dc.contributor.author | Khuller, Samir | en_US |
| dc.date.accessioned | 2007-04-23T17:33:11Z | |
| dc.date.available | 2007-04-23T17:33:11Z | |
| dc.date.issued | 1988-06 | en_US |
| dc.description.abstract | Given 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. | en_US |
| dc.format.extent | 626325 bytes | |
| dc.format.extent | 255174 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR88-921 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/6761 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | On Computing Graph Closures | en_US |
| dc.type | technical report | en_US |