منابع مشابه
Algorithms for generating large-scale clustered random graphs
Real-world networks are often compared to random graphs to assess whether their topological structure could be a result of random processes. However, a simple random graph in large scale is often lack of local structure beyond dyadic level and as a result we need to generate clustered random graph to compare the local structure at higher network levels. In this paper a generalized version of Gl...
متن کاملCompletely Connected Clustered Graphs
Planar drawings of clustered graphs are considered. We introduce the notion of completely connected clustered graphs, i.e. hierarchically clustered graphs that have the property that not only every cluster but also each complement of a cluster induces a connected subgraph. As a main result, we prove that a completely connected clustered graph is c-planar if and only if the underlying graph is p...
متن کاملPerfectness of clustered graphs
Given a clustered graph (G,V), that is, a graph G = (V,E) together with a partition V of its vertex set, the selective coloring problem consists in choosing one vertex per cluster such that the chromatic number of the subgraph induced by the chosen vertices is minimum. This problem can be formulated as a covering problem with a 0-1 matrix M(G,V). Nevertheless, we observe that, given (G,V), it i...
متن کاملDetecting random walks on graphs with heterogeneous sensors
We consider the problem of detecting a random walk on a graph, based on observations of the graph nodes. When visited by the walk, each node of the graph observes a signal of elevated mean, which we assume can be different across different nodes. Outside of the path of the walk, and also in its absence, nodes measure only noise. Assuming the Neyman-Pearson setting, our goal then is to character...
متن کاملMultilayer Drawings of Clustered Graphs
The cluster adjacency graph of a flat clustered graph C(G, T ) is the graph A whose vertices are the clusters in T and whose edges connect clusters containing vertices that are adjacent in G. A multilayer drawing of a clustered graph C consists of a straight-line c-planar drawing of C in which the clusters are drawn as convex regions and of a straight-line planar drawing of A such that each ver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EPL (Europhysics Letters)
سال: 2014
ISSN: 0295-5075,1286-4854
DOI: 10.1209/0295-5075/105/68006