Results 11 to 20 of about 1,255,445 (300)
A Graph Pebbling Algorithm on Weighted Graphs
Journal of Graph Algorithms and Applications, 2010 A pebbling move on a weighted graph removes some pebbles at a vertex and adds one pebble at an adjacent vertex. The number of pebbles removed is the weight of the edge connecting the vertices.
Nandor Sieben
doaj +5 more sources
Evaluating a weighted graph polynomial for graphs of bounded tree-width [PDF]
, 2009 We show that for any $k$ there is a polynomial time algorithm to evaluate the weighted graph polynomial $U$ of any graph with tree-width at most $k$ at any point.
Noble, S D
core +5 more sources
Algorithms for finding the minimum cycle mean in the weighted directed graph [PDF]
Computer Science Journal of Moldova, 1998 In this paper we study the problem of finding the minimum cycle mean in the weighted directed graph. The computational aspect of some algorithms for solving this problem is discussed and two algorithms for minimum cycle mean finding in the weighted ...
D. Lozovanu, C. Petic
doaj +2 more sources
Stabilizing Weighted Graphs [PDF]
Mathematics of Operations Research, 2020 An edge-weighted graph [Formula: see text] is called stable if the value of a maximum-weight matching equals the value of a maximum-weight fractional matching. Stable graphs play an important role in network bargaining games and cooperative matching games, because they characterize instances that admit stable outcomes.
Zhuan Khye Koh, Laura Sanità
openaire +8 more sources
Compression of weighted graphs [PDF]
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, 2011 We propose to compress weighted graphs (networks), motivated by the observation that large networks of social, biological, or other relations can be complex to handle and visualize. In the process also known as graph simplification, nodes and (unweighted) edges are grouped to supernodes and superedges, respectively, to obtain a smaller graph.
Hannu Toivonen +3 more
openaire +3 more sources
Weighted Graphs and Fuzzy Graphs
, 2023 It has been shown in literature that in the two-dimensional case, the lattices of truth values considered are pairwise isomorphic, and so are the corresponding families of fuzzy sets. Therefore, each result for one of these types of fuzzy sets can be directly rewritten for each (isomorphic) type of fuzzy sets.
Mathew, Sunil +2 more
openaire +3 more sources
The Oriented and Flux-Weighted Current Density Stagnation Graph of LiH [PDF]
, 2022 A scheme is introduced to quantitatively analyze the magnetically induced molecular current density vector field J. After determining the set of zero points of J, which is called its stagnation graph (SG), the line integrals -1/mu_0 \int_li B.dl along ...
Raphael J F, Berger +3 more
core +1 more source
MINORS IN WEIGHTED GRAPHS [PDF]
Bulletin of the Australian Mathematical Society, 2008 AbstractWe define the notion of minor for weighted graphs. We prove that with this minor relation, the set of weighted graphs is directed. We also prove that, given any two weights on a connected graph with the same total weight, we can transform one into the other using a sequence of edge subdivisions and edge contractions.
Joiţa, Cezar, Joiţa, Daniela
openaire +1 more source
Metrization of Weighted Graphs [PDF]
Annals of Combinatorics, 2013 7 ...
Vuorinen Matti +2 more
openaire +2 more sources
Convolution operators and the discrete Laplacian [PDF]
, 2009 PhDIn this thesis, we obtain new results for convolution operators on homogeneous spaces and give applications to the Laplacian on a homogeneous graph. Some of these results have been published in joint papers [13, 14] with my supervisor.
Chen, Chung-Chuan
core +3 more sources