Optimum and suboptimum methods for permuting a matrix into bordered triangular form (Q1135085): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0016-0032(80)90020-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1973176219 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On bordered triangular or lower N forms of an irreducible matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4097182 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Output Set Assignments and Degree Switching Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank

Latest revision as of 04:02, 13 June 2024

scientific article
Language Label Description Also known as
English
Optimum and suboptimum methods for permuting a matrix into bordered triangular form
scientific article

    Statements

    Optimum and suboptimum methods for permuting a matrix into bordered triangular form (English)
    0 references
    0 references
    0 references
    1980
    0 references
    0 references
    permuting a matrix
    0 references
    bordered triangular form
    0 references
    degree switching operations
    0 references
    digraph of the matrix
    0 references
    algorithm
    0 references
    0 references