Results 1  10
of
273,519
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
LINEAR SYSTEMS ON EDGEWEIGHTED GRAPHS
"... Abstract. Let R be any subring of the reals. We present a generalization of linear systems on graphs where divisors are Rvalued functions on the set of vertices and graph edges are permitted to have nonnegative weights in R. Using this generalization, we provide an independent proof of a RiemannRo ..."
Abstract
 Add to MetaCart
Abstract. Let R be any subring of the reals. We present a generalization of linear systems on graphs where divisors are Rvalued functions on the set of vertices and graph edges are permitted to have nonnegative weights in R. Using this generalization, we provide an independent proof of a Riemann
M.: A linear algorithm for finding the invariant edges of an edgeweighted graph
 SIAM J. on Computing
, 2002
"... Abstract. Given an edgeweighted graph where all weights are nonnegative reals, an edge reweighting is an assignment of nonnegative reals to edges such that, for each vertex, the sums of given and new weights assigned to the edges incident on the vertex do coincide. An edge is then said to be invari ..."
Abstract

Cited by 6 (6 self)
 Add to MetaCart
Abstract. Given an edgeweighted graph where all weights are nonnegative reals, an edge reweighting is an assignment of nonnegative reals to edges such that, for each vertex, the sums of given and new weights assigned to the edges incident on the vertex do coincide. An edge is then said
Haj'os Theorem for Colorings of EdgeWeighted Graphs
 Combinatorica
, 2001
"... Haj'os theorem states that every graph with chromatic number at least k can be obtained from the complete graph K k by a sequence of simple operations such that every intermediate graph also has chromatic number at least k. Here, Haj'os theorem is extended in three slightly different w ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
ways to colorings and circular colorings of edgeweighted graphs. These extensions shed some new light on the Haj'os theorem and show that colorings of edgeweighted graphs are most natural extension of usual graph colorings. 1
Constructive links between some morphological hierarchies on edgeweighted graphs
 INTERNATIONAL SYMPOSIUM ON MATHEMATICAL MORPHOLOGY, UPPSALA: SWEDEN
, 2013
"... In edgeweighted graphs, we provide a unified presentation of a family of popular morphological hierarchies such as component trees, quasi flat zones, binary partition trees, and hierarchical watersheds. For any hierarchy of this family, we show if (and how) it can be obtained from any other eleme ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
In edgeweighted graphs, we provide a unified presentation of a family of popular morphological hierarchies such as component trees, quasi flat zones, binary partition trees, and hierarchical watersheds. For any hierarchy of this family, we show if (and how) it can be obtained from any other
Frequent Subgraph Mining on Edge Weighted Graphs
"... Abstract. Frequent subgraph mining entails two significant overheads. The first is concerned with candidate set generation. The second with isomorphism checking. These are also issues with respect to other forms of frequent pattern mining but are exacerbated in the context of frequent subgraph min ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
mining. To reduced the search space, and address these twin overheads, a weighted approach to subgraph mining is proposed. However, a significant issue in weighted subgraph mining is that the antimonotone property, typically used to control candidate set generation, no longer holds. This paper examines
A RiemannRoch theorem for edgeweighted graphs, arXiv:0908.1197v2 [math.AG
, 2009
"... Abstract. We prove a RiemannRoch theorem for real divisors on edgeweighted graphs over the reals, extending the result of Baker and Norine for integral divisors on graphs with multiple edges. 1. ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. We prove a RiemannRoch theorem for real divisors on edgeweighted graphs over the reals, extending the result of Baker and Norine for integral divisors on graphs with multiple edges. 1.
A Fast EdgeSplitting Algorithm in EdgeWeighted Graphs
, 2006
"... SUMMARY Let H be a graph with a designated vertex s, where edges are weighted by nonnegative reals. Splitting edges e = {u, s} and e ′ = {s,v} at s is an operation that reduces the weight of each of e and e ′ by a real δ>0 while increasing the weight of edge {u,v} by δ. It is known that all edge ..."
Abstract
 Add to MetaCart
SUMMARY Let H be a graph with a designated vertex s, where edges are weighted by nonnegative reals. Splitting edges e = {u, s} and e ′ = {s,v} at s is an operation that reduces the weight of each of e and e ′ by a real δ>0 while increasing the weight of edge {u,v} by δ. It is known that all
Playing with Kruskal: algorithms for morphological trees in edgeweighted graphs
 INTERNATIONAL SYMPOSIUM ON MATHEMATICAL MORPHOLOGY, UPPSALA: SWEDEN
, 2013
"... The goal of this paper is to provide linear or quasilinear algorithms for producing some of the various trees used in mathemetical morphology, in particular the trees corresponding to hierarchies of watershed cuts and hierarchies of constrained connectivity. A specific binary tree, corresponding ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
to an ordered version of the edges of the minimum spanning tree, is the key structure in this study, and is computed thanks to variations around Kruskal algorithm for minimum spanning tree.
Supervised Learning of a Generative Model for EdgeWeighted Graphs
"... This paper addresses the problem of learning archetypal structural models from examples. To this end we define a generative model for graphs where the distribution of observed nodes and edges is governed by a set of independent Bernoulli trials with parameters to be estimated from data in a situatio ..."
Abstract
 Add to MetaCart
This paper addresses the problem of learning archetypal structural models from examples. To this end we define a generative model for graphs where the distribution of observed nodes and edges is governed by a set of independent Bernoulli trials with parameters to be estimated from data in a
Results 1  10
of
273,519