Nested Dissection for Sparse Nullspace Bases
| dc.contributor.author | Stern, Julio M. | en_US |
| dc.contributor.author | Vavasis, Stephen A. | en_US |
| dc.date.accessioned | 2007-04-23T17:50:58Z | |
| dc.date.available | 2007-04-23T17:50:58Z | |
| dc.date.issued | 1990-12 | en_US |
| dc.description.abstract | We propose a nested dissection approach to finding a fundamental cycle basis in a planar graph. the cycle basis corresponds to a fundamental nullspace basis of the adjacency matrix. This problem is meant to model sparse null basis computations occurring in a variety of settings. We achieve an O(n**3/2) bound on the nullspace basis size and an O(nlogn) bound on the size in the special case of grid graphs. | en_US |
| dc.format.extent | 1046515 bytes | |
| dc.format.extent | 320891 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/TR90-1173 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/7013 | |
| 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 | Nested Dissection for Sparse Nullspace Bases | en_US |
| dc.type | technical report | en_US |