Skip to main content


eCommons@Cornell

eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/7013
Title: Nested Dissection for Sparse Nullspace Bases
Authors: Stern, Julio M.
Vavasis, Stephen A.
Keywords: computer science
technical report
Issue Date: Dec-1990
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR90-1173
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.
URI: http://hdl.handle.net/1813/7013
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
90-1173.pdf1.02 MBAdobe PDFView/Open
90-1173.ps313.37 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.

 

© 2014 Cornell University Library Contact Us