Polynomial-time algorithms for submodular Laplacian systems (Q2235770): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Eigenvalues and expanders / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rings of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2809807 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks and local cuts in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving SDD linear systems in nearly <i>m</i> log <sup>1/2</sup> <i>n</i> time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular functions and optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Parametric Maximum Flow Algorithm and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Generation of Random Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial solvability of convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4969175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error Bounds for Piecewise Convex Quadratic Programs and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraph Laplacian and the Degree of Asymmetry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph Markov Operators, Eigenvalues and Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selected Applications of Minimum Cuts in Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalent Subgradient Versions of Hamiltonian and Euler–Lagrange Equations in Variational Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Sparsification by Effective Resistances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lx = b / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of Karmarkar's projective algorithm for convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cheeger Inequalities for Submodular Transformations / rank
 
Normal rank

Latest revision as of 20:53, 26 July 2024

scientific article
Language Label Description Also known as
English
Polynomial-time algorithms for submodular Laplacian systems
scientific article

    Statements

    Polynomial-time algorithms for submodular Laplacian systems (English)
    0 references
    0 references
    0 references
    0 references
    21 October 2021
    0 references
    submodular functions
    0 references
    Laplacian systems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers