Polynomial-time algorithms for submodular Laplacian systems
From MaRDI portal
Publication:2235770
DOI10.1016/j.tcs.2021.09.019OpenAlexW3204962356MaRDI QIDQ2235770
Tasuku Soma, Yuichi Yoshida, Kaito Fujii
Publication date: 21 October 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.10923
Related Items (2)
Finding Cheeger cuts in hypergraphs via heat equation ⋮ Nonlinear evolution equation associated with hypergraph Laplacian
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- Random walks and local cuts in graphs
- Eigenvalues and expanders
- An extension of Karmarkar's projective algorithm for convex quadratic programming
- Submodular functions and optimization.
- Rings of sets
- Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems
- Hypergraph Markov Operators, Eigenvalues and Approximation Algorithms
- The polynomial solvability of convex quadratic programming
- Selected Applications of Minimum Cuts in Networks
- A Fast Parametric Maximum Flow Algorithm and Applications
- Error Bounds for Piecewise Convex Quadratic Programs and Applications
- Equivalent Subgradient Versions of Hamiltonian and Euler–Lagrange Equations in Variational Analysis
- Digraph Laplacian and the Degree of Asymmetry
- Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs
- Faster Generation of Random Spanning Trees
- Cheeger Inequalities for Submodular Transformations
- Solving SDD linear systems in nearly m log 1/2 n time
- Lx = b
- Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
- STACS 2005
- Graph Sparsification by Effective Resistances
This page was built for publication: Polynomial-time algorithms for submodular Laplacian systems
