Min—max-boundary domain decomposition

Authors:
Marcos Kiwi;Daniel A. Spielman;Shang-Hua Teng
Affiliations:
Univ. de Chile, Casilla, Chile;M.I.T., Cambridge, MA;Univ. of Illinois, Urbana-Champaign, Urbana
Venue:
Theoretical Computer Science
Year:
2001

Citing 0
Cited 2

Tight bounds for the Min-Max boundary decomposition cost of weighted graphs

Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
A linear work, O(n1/6) time, parallel algorithm for solving planar Laplacians

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms

Quantified Score

Hi-index	5.23

Visualization

Abstract