Results 31 to 40 of about 1,255,445 (300)
Consistent graph layout for weighted graphs [PDF]
The 3rd ACS/IEEE International Conference onComputer Systems and Applications, 2005., 2005 Summary form only given. In this paper, we present three algorithms that build graph layouts for undirected, weighted graphs. Our goal is to generate layouts that are consistent with the weights in the graph. We introduce tree algorithms and show that they can be successful in solving the problem up to a certain precision.
Dana Vrajitoru, Jason DeBoni
openaire +2 more sources
Cluster Persistence for Weighted Graphs
Entropy, 2023 Persistent homology is a natural tool for probing the topological characteristics of weighted graphs, essentially focusing on their 0-dimensional homology. While this area has been thoroughly studied, we present a new approach to constructing a filtration for cluster analysis via persistent homology. The key advantages of the new filtration is that (a)
Omer Bobrowski, Primoz Skraba
openaire +5 more sources
Finding a heaviest vertex-weighted triangle is not harder than matrix multiplication [PDF]
, 2009 We show that a maximum-weight triangle in an undirected graph with n vertices and real weights assigned to vertices can be found in time O(n(omega) + n(2+o(1))), where omega is the exponent of the fastest matrix multiplication algorithm. By the currently
Lingas, Andrzej, +4 more
core +1 more source
NSGAII With Local Search Based Heavy Perturbation for Bi-Objective Weighted Clique Problem
IEEE Access, 2018 This paper focuses on the clique problem of a weighted graph where weights of vertices can be either positive or negative (WG-PN). Two objectives, the size and the total weight of a clique, are considered.
Dunbo Cai, Yuhui Gao, Minghao Yin
doaj +1 more source
Exploring Graph and Digraph Persistence
Algorithms, 2023 Among the various generalizations of persistent topology, that based on rank functions and leading to indexing-aware functions appears to be particularly suited to catching graph-theoretical properties without the need for a simplicial construction and a
Mattia G. Bergomi, Massimo Ferri
doaj +1 more source
Discrete Mathematics, 1999 The \(\alpha\)-weight of an edge \(xy\) of a graph \(G\) is \(d(x)^\alpha\cdot d(y)^\alpha\) where \(d(x)\) and \(d(y)\) are the degrees of the vertices \(x\) and \(y\). The \(\alpha\)-weight of \(G\) is the sum of the \(\alpha\)-weights of its edges. The authors establish the \(\alpha\)-weight of a graph with any fixed number of edges for \(\alpha=1\)
Béla Bollobás +2 more
openaire +2 more sources
Decomposing Weighted Graphs [PDF]
Journal of Graph Theory, 2017 Abstract We solve the following problem: Can an undirected weighted graph G be partitioned into two nonempty induced subgraphs satisfying minimum constraints for the sum of edge weights at vertices of each subgraph? We show that this is possible for all constraints
openaire +2 more sources
Adaptive Graph Representation for Clustering
IEEE Access, 2022 Many graph construction methods for clustering cannot consider both local and global data structures in the construction of initial graph. Meanwhile, redundant features or even outliers and data with important characteristics are addressed equally in the
Mei Chen +5 more
doaj +1 more source
若干运算图的倍乘赋权Harary指标(Multiplicatively weighted Harary index of some graph operations)
Zhejiang Daxue xuebao. Lixue ban, 2017 Recently, ALIZADEH et al proposed a modification of the Harary index in which the contributions of vertex pairs were weighted by the product of their degrees.
WENYanqing(温艳清) +2 more
doaj +1 more source
Maximization of the Spectral Gap for Chemical Graphs by means of a Solution to a Mixed Integer Semidefinite Program [PDF]
Computer Methods in Materials Science, 2016 In this paper we analyze the spectral gap of a weighted graph which is the difference between the smallest positive and largest negative eigenvalue of its adjacency matrix. Such a graph can represent e.g. a chemical organic molecule.
Soňa Pavlíková, Daniel Ševčovič
doaj +1 more source