Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors (Q521811): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-015-0109-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2229245939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure at inifinity of linear multivariable systems: A geometric approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valuated matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4000061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the maximum degree of minors in matrix pencils via combinatorial relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual Combinatorial Relaxation Algorithms for the Maximum Degree of Subdeterminants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Puiseux-Series Solutions to Determinantal Equations via Combinatorial Relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial relaxation algorithm for the maximum degree of subdeterminants: Computing Smith-McMillan form at infinity and structural indices in Kronecker form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Degree of Determinants via Combinatorial Relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding optimal minors of valuated bimatroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrices and matroids for systems analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors in mixed polynomial matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some techniques useful for solution of transportation network problems / rank
 
Normal rank

Latest revision as of 15:56, 13 July 2024

scientific article
Language Label Description Also known as
English
Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors
scientific article

    Statements

    Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors (English)
    0 references
    0 references
    0 references
    12 April 2017
    0 references
    combinatorial relaxation
    0 references
    degree of minor
    0 references
    valuated bimatroid
    0 references
    discrete concavity
    0 references

    Identifiers