Semantic Scholar uses AI to extract papers important to this topic.
Party Problem: Find the minimum number R(k, l) of guests that must be invited so that at least k will know each other or at least… Expand Abstract Community detection in networks is one of the most popular topics of modern network science. Communities, or clusters… Expand Very high resolution satellite images provide valuable information to researchers. Among these, urban-area boundaries and… Expand Dryad is a general-purpose distributed execution engine for coarse-grain data-parallel applications. A Dryad application combines… Expand Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many… Expand Despite its increasing role in communication, the World-Wide Web remains uncontrolled: any individual or institution can create a… Expand A centroidal Voronoi tessellation is a Voronoi tessellation whose generating points are the centroids (centers of mass) of the… Expand Large networks, having thousands of vertices and lines, can be found in many different areas, e. g: genealogies, flo w graphs of… Expand Main point Sibson gives an O(n 2) algorithm for single-linkage clustering, and proves that this algorithm achieves the… Expand An algorithm is described for optimally pamng a finit e set of objects. That is, given a real numerical weight for each unordered… Expand