Nested Dissection for Sparse Nullspace Bases

  • Authors:

  • Julio M. Stern;Stephen A. Vavasis

  • Affiliations:

  • -;-

  • Venue:
  • Nested Dissection for Sparse Nullspace Bases
  • Year:
  • 1990

Quantified Score

Hi-index 0.00

Visualization

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.