A combinatorial cut-toggling algorithm for solving Laplacian linear systems (Q6066766): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit Capacity Maxflow in Almost $m^{4/3}$ Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple, combinatorial algorithm for solving SDD systems in nearly-linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Empirical Comparison of Graph Laplacian Solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering a combinatorial Laplacian solver: lessons learned / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding minimum-cost circulations by canceling negative cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two strongly polynomial cut cancelling algorithms for minimum cost network flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Framework for Analyzing Resparsification Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using petal-decompositions to build a low stretch spanning tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Flow Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A data structure for dynamic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cuts in near-linear time / 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: Spectral Sparsification of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral sparsification via random spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient parallel solver for SDD linear systems / rank
 
Normal rank

Latest revision as of 13:04, 21 August 2024

scientific article; zbMATH DE number 7777568
Language Label Description Also known as
English
A combinatorial cut-toggling algorithm for solving Laplacian linear systems
scientific article; zbMATH DE number 7777568

    Statements

    A combinatorial cut-toggling algorithm for solving Laplacian linear systems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 December 2023
    0 references
    Laplacian solver
    0 references
    electrical flow
    0 references
    data structure
    0 references

    Identifiers