Fitting a graph to one-dimensional data

DOI10.1016/j.tcs.2021.03.020zbMath1474.68214arXiv1809.02948OpenAlexW3136639104MaRDI QIDQ2663044

Taegyoung Lee, Zhengtong Ren, Siu-Wing Cheng, Otfried Schwarzkopf

Publication date: 15 April 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1809.02948

zbMATH Keywords

dynamic programming algorithmweighted path graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39)

Uses Software

• z3

Cites Work

• Interior path following primal-dual algorithms. II: Convex quadratic programming
• Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems
• Handbook of Algorithms for Physical Design Automation
• Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
• Solving SDD linear systems in nearly m log ^1/2 n time
• Approaching Optimality for Solving SDD Linear Systems
• A Nearly-m log n Time Solver for SDD Linear Systems
• A simple, combinatorial algorithm for solving SDD systems in nearly-linear time

This page was built for publication: Fitting a graph to one-dimensional data