Degree switching operations in networks and large scale systems assignment problems (Q1139029): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1016/0016-0032(80)90028-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2072420850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Results on Sparse Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A desirable form for sparse matrices when computing their inverse in factored forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning and Tearing Systems of Equations / 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: Optimum and suboptimum methods for permuting a matrix into bordered triangular form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum tearing in large scale systems and minimum feedback cutsets of a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4097182 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Vertex Elimination on Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph theoretical interpretation of nonsymmetric permutation on sparse matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for then×n optimum assignment problem / 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: A \(0(| V | \cdot | E |)\) algorithm for maximum matching of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Matching Problems for Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5515142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / 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: Matrix reduction—an efficient method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Combinatorial Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost / rank
 
Normal rank

Latest revision as of 04:51, 13 June 2024

scientific article
Language Label Description Also known as
English
Degree switching operations in networks and large scale systems assignment problems
scientific article

    Statements

    Degree switching operations in networks and large scale systems assignment problems (English)
    0 references
    1980
    0 references
    0 references
    0 references
    0 references
    0 references
    listing all output sets for a large sparse square matrix
    0 references
    degree switching operations
    0 references
    optimum assignment problem
    0 references
    vertex disjoint cycles of specified lengths
    0 references
    0 references