Abstract: In this paper, we present a system for the interactive visualization and exploration of graphs with many weakly connected components. The visualization of large graphs has recently received ...

Let G = (V(G), E(G)) be a graph. A set S ⊆ E(G) is an edge k-cut in G if the graph G − S = (V(G), E(G) \ S) has at least k connected components. The generalized k-edge connectivity of a graph G, ...

This paper investigates allocation rules in graph-structured cooperative games (hereinafter referred to as graph games) by integrating the notion of network control. A component-restricted game and ...

Abstract: Graph jobs represent a wide variety of computation-intensive tasks in which computations are represented by graphs consisting of components (denoting either data sources or data processing) ...

This is a preview. Log in through your library . Abstract We study the size of connected components of random nearest-neighbor graphs with vertex set the points of a homogeneous Poisson point process ...

Business School, University of Shanghai for Science and Technology, Shanghai, China. The central question in cooperative game theory is how to allocate the worth of coalitions in a fair and reasonable ...

Check approxCCDegree.cpp for the code, and sample.cpp for a sample implementation. Let n u be the number of nodes in the connected component where the node u is located. The number of connected ...