Demange, M., Paschos, V. Th.: Improved approximations for weighted and un- weighted graph problems. Theory of Computing Systems. To appearM. Demange and V. Th. Paschos. Improved approximations for weighted and unweighted graph problems. Theory of Computing Systems, 38:763-787, 2005....
Chen, P. Lu, Graph homomorphisms with complex values: A dichotomy theorem, in: Proc. 37th International Colloquium on Automata, Languages and Programming (Part 1), 2010, pp. 275–286. Google Scholar [6] J.-Y. Cai, X. Chen, P. Lu, Non-negatively weighted #CSP: An effective ...
Here, we studied whether similar network changes in weighted and unweighted networks can be found in generalized absence seizures recorded with surface EEG. We retrospectively selected EEG recordings of eleven children with absence seizures. The functional neural networks were characterized by calculating ...
This transformation has revealed multiscale self-similarity to be a ubiquitous symmetry in the binarized structure of real networks, and allows to obtain scaled down replicas. However, the GR technique is restricted to unweighted network representations. Information about the intensities of interactions ...
2) unweighted graph 非加权图 3) weighted Voronoi diagram 加权Voronoi图 1. A study on the division of urban economic regions based onweighted Voronoi diagram; 基于加权Voronoi图的城市经济区划分方法探讨 2. Based on this theory,a thought of drawingweighted Voronoi diagrams is proposed: firstly,findin...
In this work, we present a new definition of weighted coreness for vertices in a weighted graph, by taking into account the weights of vertices, which makes the coreness in unweighted graph be a special case. We propose efficient algorithms for both weighted core decomposition and weighted ...
graph such that differences of the components provide information about the distances between the vertices.According to the distances,the SPWUG algorithm computed the initial partition of the coarsest graph by extending the Laplacian spectral graph theory from the unweighted undirected graph into the ...
Thus, graph mining has been an active research area in recent years. Most of the graph min-ing research focuses on mining unweighted graphs. However, weighted graphs are actually more common. The weight on an edge may represent the likelihood of the existence of the edge or the strength of...
摘要: A graph is called a weighted graph if each edge e is assigned a non-negative number w(e), called the weight of e. In this paper, some theorems on the existence of long paths and cycles in unweighted graphs are generalized to weighted graphs and some related problems are proposed....
3) Connected unweighted undirected graphs 无向非加权图4) undirected weighted graph 无向赋权图 1. The solution-based DPCNN to the minimum spanning tree of undirected weighted graph; 基于DPCNN的无向赋权图的最小生成树的求解 2. Undirected Weighted Graph Hamilton Path Question Based on DNA ...