Fitting a graph to one-dimensional data (Q2663044): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1809.02948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Algorithms for Physical Design Automation / 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: A simple, combinatorial algorithm for solving SDD systems in nearly-linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nearly-m log n Time Solver for SDD Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approaching Optimality for Solving SDD Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior path following primal-dual algorithms. II: Convex quadratic programming / rank
 
Normal rank
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: Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems / rank
 
Normal rank

Latest revision as of 23:29, 24 July 2024

scientific article
Language Label Description Also known as
English
Fitting a graph to one-dimensional data
scientific article

    Statements

    Identifiers