A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph (Q4315432): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: profile wavefront / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/cnm.1640101107 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2168238367 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3664299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing extremal and approximate distances in graphs having unit cost edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: A FORTRAN program for profile and wavefront reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two‐step approach to finite element ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: An equation numbering algorithm based on a minimum front criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on minimizing the bandwidth of sparse, symmetric matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Implementation of a Pseudoperipheral Node Finder / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding pseudoperipheral nodes in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the reduction of matrix bandwidth and profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic graph theory for ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Finding a Pseudoperipheral Node in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Algebra in Geography: Eigenvectors of Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparasion of three resequencing algorithms for the reduction of matrix profile and wavefront / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node and element resequencing using the Laplacian of a finite element graph: Part I—General concepts and algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues of the Laplacian of a graph<sup>∗</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5682350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3877805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning Sparse Matrices with Eigenvectors of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lanczos versus subspace iteration for solution of eigenvalue problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995619 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse matrix test problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation of the Gibbs-Poole-Stockmeyer and Gibbs-King Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692391 / rank
 
Normal rank

Latest revision as of 09:55, 23 May 2024

scientific article; zbMATH DE number 701727
Language Label Description Also known as
English
A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph
scientific article; zbMATH DE number 701727

    Statements

    A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 November 1995
    0 references
    endpoints
    0 references
    spectral graph
    0 references
    Laplacian matrix of a graph
    0 references
    algorithm
    0 references
    pseudoperipheral vertex
    0 references
    pseudodiameter
    0 references
    sparse matrix equations
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references