Results 21  30
of
619,419
On weighted graph homomorphisms
 Special DIMACSAMS volume on Graph Homomorphisms and Statistical Physics Models
, 2004
"... For given graphs G and H, let Hom(G,H)  denote the set of graph homomorphisms from G to H. We show that for any finite, nregular, bipartite graph G and any finite graph H (perhaps with loops), Hom(G,H)  is maximum when G is a disjoint union of Kn,n’s. This generalizes a result of J. Kahn on the ..."
Abstract

Cited by 14 (10 self)
 Add to MetaCart
on the number of independent sets in a regular bipartite graph. We also give the asymptotics of the logarithm of Hom(G,H)  in terms of a simply expressed parameter of H. We also consider weighted versions of these results which may be viewed as statements about the partition functions of certain models
Consistent graph layout for weighted graphs
 In The 3rd ACS/IEEE International Conference on Computer Systems and Applications
, 2005
"... 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. All of the algorithms are forceoriented and have been successful in solving the problem up to a certain precision. T ..."
Abstract

Cited by 5 (5 self)
 Add to MetaCart
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. All of the algorithms are forceoriented and have been successful in solving the problem up to a certain precision
Community detection in graphs
, 2009
"... The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of th ..."
Abstract

Cited by 801 (1 self)
 Add to MetaCart
The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices
Turán problems for weighted Graphs
"... What is the maximum number of edges in a multigraph on n vertices if every kset spans at most r edges? We asymptotically determine the maximum possible weight of such (k; r)dense graphs for almost all k and r as n tends to infinity, thus giving a generalization of Tur'an's theorem. We fi ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
What is the maximum number of edges in a multigraph on n vertices if every kset spans at most r edges? We asymptotically determine the maximum possible weight of such (k; r)dense graphs for almost all k and r as n tends to infinity, thus giving a generalization of Tur'an's theorem. We
Average distance in weighted graphs
 Discrete Math
"... Dedicated to Gert Sabidussi on the occasion of his 80th birthday We consider the following generalisation of the average distance of a graph. Let G be a connected, finite graph with a nonnegative vertex weight function c. Let N be the total weight of the vertices. If N ̸ = 0, 1, then the weighted av ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Dedicated to Gert Sabidussi on the occasion of his 80th birthday We consider the following generalisation of the average distance of a graph. Let G be a connected, finite graph with a nonnegative vertex weight function c. Let N be the total weight of the vertices. If N ̸ = 0, 1, then the weighted
Lossy Compression of Dynamic, Weighted Graphs
"... Abstract—A graph is used to represent data in which the relationships between the objects in the data are at least as important as the objects themselves. Large graph datasets are becoming more common as networks such as the Internet grow, and our ability to measure these graphs improves. This neces ..."
Abstract
 Add to MetaCart
. This necessitates methods to compress these datasets. In this paper we present a method aimed at lossy compression of large, dynamic, weighted graphs. Keywordsgraph compression; dynamic, weighted graphs; shrinkage; I.
PDEs level sets on weighted graphs
 in Proc. ICIP
, 2011
"... In this paper we propose an adaptation of PDEs level sets over weighted graphs of arbitrary structure, based on PdEs and using a framework of discrete operators. A general PDEs level sets formulation is presented and an algorithm to solve such equation is described. Some transcriptions of wellknown ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
In this paper we propose an adaptation of PDEs level sets over weighted graphs of arbitrary structure, based on PdEs and using a framework of discrete operators. A general PDEs level sets formulation is presented and an algorithm to solve such equation is described. Some transcriptions of well
Heat Kernel Estimates on Weighted Graphs
 PISA PI, ITALY FACHBEREICH MATHEMATIK, DER JOHANN WOLFGANG GOETHEUNIVERSITÄT, 60054 FRANKFURT AM MAIN, GERMANY EMAIL ADDRESS: ASCHMIDT@MATH.UNIFRANKFURT.DE
, 2000
"... We prove upper and lower heat kernel bounds for the Laplacian on weighted graphs which include the case that the weights have no strictly positive lower bound. Our estimates allow for a very explicit probabilistic interpretation and can be formulated in terms of a weighted metric. Interestingly, thi ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
We prove upper and lower heat kernel bounds for the Laplacian on weighted graphs which include the case that the weights have no strictly positive lower bound. Our estimates allow for a very explicit probabilistic interpretation and can be formulated in terms of a weighted metric. Interestingly
Results 21  30
of
619,419