Results 11  20
of
619,419
Epidemics and vaccination on weighted graphs
, 2010
"... A ReedFrost epidemic with inhomogeneous infection probabilities on a graph with prescribed degree distribution is studied. Each edge (u, v) in the graph is equipped with two weights W (u,v) and W (v,u) that represent the (subjective) strength of the connection and determine the probability that u i ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
A ReedFrost epidemic with inhomogeneous infection probabilities on a graph with prescribed degree distribution is studied. Each edge (u, v) in the graph is equipped with two weights W (u,v) and W (v,u) that represent the (subjective) strength of the connection and determine the probability that u
On the Spanning Trees of Weighted Graphs
 Combinatorica
, 1990
"... Given a weighted graph, let W 1 ; W 2 ; W 3 ; : : : denote the increasing sequence of all possible distinct spanning tree weights. Settling a conjecture due to Kano, we prove that every spanning tree of weight W 1 is at most k \Gamma 1 edge swaps away from some spanning tree of weight W k . Three ot ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
Given a weighted graph, let W 1 ; W 2 ; W 3 ; : : : denote the increasing sequence of all possible distinct spanning tree weights. Settling a conjecture due to Kano, we prove that every spanning tree of weight W 1 is at most k \Gamma 1 edge swaps away from some spanning tree of weight W k . Three
Circular Coloring of Weighted Graphs
 J. Graph Theory
, 1994
"... Suppose that G is a finite simple graph and w is a weight function which assigns to each vertex of G a nonnegative real number. Let C be a circle of length t. A tcircular coloring of (G; w) is a mapping \Delta of the vertices of G to arcs of C such that \Delta(x) " \Delta(y) = Ø if xy 2 E(G) ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Suppose that G is a finite simple graph and w is a weight function which assigns to each vertex of G a nonnegative real number. Let C be a circle of length t. A tcircular coloring of (G; w) is a mapping \Delta of the vertices of G to arcs of C such that \Delta(x) " \Delta(y) = Ø if xy 2 E
Toric Varieties Associated with Weighted Graphs
"... We give an algorithm to associate a toric variety with a given weighted graph whose incidence matrix is negative definite. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We give an algorithm to associate a toric variety with a given weighted graph whose incidence matrix is negative definite.
COPIES OF A ROOTED WEIGHTED GRAPH ATTACHED TO AN ARBITRARY WEIGHTED GRAPH AND APPLICATIONS
, 2013
"... The spectrum of the Laplacian, signless Laplacian and adjacency matrices of the family of the weighted graphs R{H}, obtained from a connected weighted graph R on r vertices and r copies of a modified Bethe tree H by identifying the root of the ith copy of H with the ith vertex of R, is determined ..."
Abstract
 Add to MetaCart
The spectrum of the Laplacian, signless Laplacian and adjacency matrices of the family of the weighted graphs R{H}, obtained from a connected weighted graph R on r vertices and r copies of a modified Bethe tree H by identifying the root of the ith copy of H with the ith vertex of R
SemiSupervised Learning Using Gaussian Fields and Harmonic Functions
 IN ICML
, 2003
"... An approach to semisupervised learning is proposed that is based on a Gaussian random field model. Labeled and unlabeled data are represented as vertices in a weighted graph, with edge weights encoding the similarity between instances. The learning ..."
Abstract

Cited by 741 (15 self)
 Add to MetaCart
An approach to semisupervised learning is proposed that is based on a Gaussian random field model. Labeled and unlabeled data are represented as vertices in a weighted graph, with edge weights encoding the similarity between instances. The learning
ELA COPIES OF A ROOTED WEIGHTED GRAPH ATTACHED TO AN ARBITRARY WEIGHTED GRAPH AND APPLICATIONS∗
, 2013
"... Copies of a rooted weighted graph attached to an arbitrary weighted graph and applications ..."
Abstract
 Add to MetaCart
Copies of a rooted weighted graph attached to an arbitrary weighted graph and applications
Difference Equations on weighted graphs
 J. Convex Anal
"... In discrete systems graphs represent a basic tool to study links between agents. There has been recently in the literature interesting articles whose goal is to mimic on graphs well known problems of PDE (Partial Differential Equations) type. In particular the discrete Laplacian has been considered ..."
Abstract

Cited by 25 (0 self)
 Add to MetaCart
In discrete systems graphs represent a basic tool to study links between agents. There has been recently in the literature interesting articles whose goal is to mimic on graphs well known problems of PDE (Partial Differential Equations) type. In particular the discrete Laplacian has been considered and
The geometry of graphs and some of its algorithmic applications
 Combinatorica
, 1995
"... In this paper we explore some implications of viewing graphs as geometric objects. This approach offers a new perspective on a number of graphtheoretic and algorithmic problems. There are several ways to model graphs geometrically and our main concern here is with geometric representations that r ..."
Abstract

Cited by 543 (20 self)
 Add to MetaCart
that respect the metric of the (possibly weighted) graph. Given a graph G we map its vertices to a normed space in an attempt to (i) Keep down the dimension of the host space and (ii) Guarantee a small distortion, i.e., make sure that distances between vertices in G closely match the distances between
Circular colorings of edgeweighted graphs
 J. Graph Theory
, 2003
"... The notion of (circular) colorings of edgeweighted graphs is introduced. This notion generalizes the notion of (circular) colorings of graphs, the channel assignment problem, and several other optimization problems. For instance, its restriction to colorings of weighted complete graphs corresponds ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
The notion of (circular) colorings of edgeweighted graphs is introduced. This notion generalizes the notion of (circular) colorings of graphs, the channel assignment problem, and several other optimization problems. For instance, its restriction to colorings of weighted complete graphs corresponds
Results 11  20
of
619,419