Keywords
Affiliated Institutions
Related Publications
Partitioning Sparse Matrices with Eigenvectors of Graphs
The problem of computing a small vertex separator in a graph arises in the context of computing a good ordering for the parallel factorization of sparse, symmetric matrices. An ...
Consensus and Cooperation in Networked Multi-Agent Systems
<para xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> This paper provides a theoretical framework for analysis of consensus algorithms...
Graph rigidity and distributed formation stabilization of multi-vehicle systems
We provide a graph theoretical framework that allows us to formally define formations of multiple vehicles and the issues arising in uniqueness of graph realizations and its con...
On the Quality of Spectral Separators
Computing graph separators is an important step in many graph algorithms. A popular technique for finding separators involves spectral methods. However, there has not been much ...
A spectral algorithm for envelope reduction of sparse matrices
Abstract The problem of reordering a sparse symmetric matrix to reduce its envelope size is considered. A new spectral algorithm for computing an envelopeāreducing reordering is...
Publication Info
- Year
- 2002
- Type
- article
- Volume
- 35
- Issue
- 1
- Pages
- 55-60
- Citations
- 231
- Access
- Closed
External Links
Social Impact
Social media, news, blog, policy document mentions
Citation Metrics
Cite This
Identifiers
- DOI
- 10.3182/20020721-6-es-1901.00090