Notes on the Distributed Computation of Merge Trees on CW-Complexes

DOI10.1007/978-3-319-44684-4_20MaRDI QIDQ5359524zbMATH OpenOpenAlexFDO

Authors Aaditya G. Landge, P.-T. Bremer, A. Gyulassy, Valerio Pascucci

Publication date 25 September 2017

Published in Mathematics and Visualization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-44684-4_20

Mathematics Subject Classification ID

Combinatorial aspects of simplicial complexes (05E45) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Merge trees in discrete Morse theory
• The Parallel Complexity of Tree Embedding Problems
• The complexity landscape of distributed locally checkable problems on trees
• The parallel complexity of tree embedding problems (extended abstract)
• Counting clique trees and computing perfect elimination schemes in parallel
• Merge-proofness in minimum cost spanning tree problems
• Distributed Tree Rearrangements for Reachability and Robust Connectivity
• Distributed Tree Rearrangements for Reachability and Robust Connectivity
• Collective tree spanners of graphs
• Algorithm Theory - SWAT 2004

Cited in

(1)

• Merge trees in discrete Morse theory

This page was built for publication: Notes on the Distributed Computation of Merge Trees on CW-Complexes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5359524)