A New Algorithm for Finding a Pseudoperipheral Node in a Graph-Reference-Cited by-同舟云学术

A New Algorithm for Finding a Pseudoperipheral Node in a Graph

Published:1990-04 Issue:2 Volume:11 Page:323-334
ISSN:0895-4798
Container-title:SIAM Journal on Matrix Analysis and Applications
language:en
Short-container-title:SIAM J. Matrix Anal. & Appl.

Author:

Grimes Roger G.,Pierce Daniel J.,Simon Horst D.

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Subject

Analysis

Link

http://epubs.siam.org/doi/pdf/10.1137/0611022

Reference13 articles.

1. Progress in Sparse Matrix Methods for Large Linear Systems On Vector Supercomputers

2. Graph Coloring Using Eigenvalue Decomposition

3. Dragoš M. Cvetković, Michael Doob, Horst Sachs, Spectra of graphs, Pure and Applied Mathematics, Vol. 87, Academic Press Inc. [Harcourt Brace Jovanovich Publishers], New York, 1980, 368–81i:050540458.05042

4. Sparse matrix test problems

Cited by 29 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Finding a Starting Vertex for the Reverse Cuthill-McKee Method for Bandwidth Reduction: A Comparative Analysis Using Asymmetric Matrices;Computational Science and Its Applications – ICCSA 2018;2018

2. A survey of direct methods for sparse linear systems;Acta Numerica;2016-05-01

3. Recognizing Information Spreaders in Terrorist Networks: 26/11 Attack Case Study;Lecture Notes in Business Information Processing;2015

4. References;Optimal Structural Analysis;2014-09-05

5. Ordering for Optimal Patterns of Structural Matrices: Algebraic Graph Theory and Meta-heuristic Based Methods;Computational Structural Analysis and Finite Element Methods;2013-11-07