Merge trees are fundamental data structures in computational topology. They track connected components in sublevel sets of scalar functions and can be used to compute 0-dimensional persistence diagrams, to construct contour trees on simply connected domains, and to quickly query the relationship between connected components in different sublevel sets. We introduce a representation of merge tree...

Given a sequence of N elements a1, a2, a3, ..., aN. The desired output will be a’1, a’2, a’3,..., a’N such that a’1≤, a’2≤, a’3≤...≤a’N using merge sort. In this paper, we propose a modification to the existing merge sort algorithm to sort the given elements when the input sequence (or a part of it) is in ascending or descending order in a more efficient way by reducing the number of comparison...

This paper proposes a proximity-concentration tradeoff in product space as a determinant of horizontal foreign direct investment (FDI). Firms that enter a foreign market by exporting are able to capture consumer surplus from introducing a differentiated product with characteristics that the incumbent cannot match. In relatively globalized product space, in contrast, consumers perceive an entran...

Providing merging techniques for business processes fosters the management and maintenance of (large) process model repositories. Contrary to existing approaches that focus on preserving behavior of all participating process models, this paper presents a merging technique that aims at preserving the difference between the participating process models by exploiting the existence of a common pare...