Results 11  20
of
273,519
Convergent and divergent numbers games for certain collections of edgeweighted graphs
, 2008
"... ..."
Elias Bound for General Distances and Stable Sets in EdgeWeighted Graphs
, 2014
"... This paper presents an extension of the Elias bound on the minimum distance of codes for discrete alphabets with general, possibly infinitevalued, distances. The bound is obtained by combining a previous extension of the Elias bound, introduced by Blahut, with an extension of a bound previously int ..."
Abstract
 Add to MetaCart
This paper presents an extension of the Elias bound on the minimum distance of codes for discrete alphabets with general, possibly infinitevalued, distances. The bound is obtained by combining a previous extension of the Elias bound, introduced by Blahut, with an extension of a bound previously introduced by the author which builds upon ideas of Gallager, Lovász and Marton. The result can in fact be interpreted as a unification of the Elias bound and of Lovász’s bound on the zeroerror capacity of a channel, both being recovered as particular cases of the one presented here. Previous extensions of the Elias bound by Berlekamp, Blahut and Piret are shown to be included as particular cases of our bound. Applications to the reliability function are then discussed.
Steiner Trees: First Summer Paper for the PhD program at GSIA
, 2000
"... Given an edgeweighted graph G = (R [ S ..."
Computer Generation of Automorphism Groups of Weighted Graphs
, 1994
"... Computational techniques are described for the automorphism groups of edgeweighted graphs. Fortran codes based on the manipulation of weighted adjacency matrices are used to compute the automorphism groups of several edgeweighted graphs. The code developed here took 37l/2 min of CPU time to genera ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Computational techniques are described for the automorphism groups of edgeweighted graphs. Fortran codes based on the manipulation of weighted adjacency matrices are used to compute the automorphism groups of several edgeweighted graphs. The code developed here took 37l/2 min of CPU time
Watersheds on edge or node weighted graphs "par l’exemple"
"... Abstract. Watersheds have been defined both for node and edge weighted graphs. We show that they are identical: for each edge (resp. node) weighted graph exists a node (resp. edge) weighted graph with the same minima and catchment basin. 1 ..."
Abstract
 Add to MetaCart
Abstract. Watersheds have been defined both for node and edge weighted graphs. We show that they are identical: for each edge (resp. node) weighted graph exists a node (resp. edge) weighted graph with the same minima and catchment basin. 1
Ant Colony Optimization for the EdgeWeighted kCardinality Tree Problem
 In GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference
, 2002
"... In this paper we deal with an NPhard combinatorial optimization problem, the kcardinality tree problem in edgeweighted graphs. This problem has several applications in practice, which justify the need for efficient methods to obtain good solutions. Metaheuristic applications have already been sho ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
In this paper we deal with an NPhard combinatorial optimization problem, the kcardinality tree problem in edgeweighted graphs. This problem has several applications in practice, which justify the need for efficient methods to obtain good solutions. Metaheuristic applications have already been
Vertexcolouring Edgeweightings
 COMBINATORICA
, 2007
"... A weighting w of the edges of a graph G induces a colouring of the vertices of G where the colour of vertex v, denoted cv, is ∑ w(e). We show that the edges of every graph that e∋v does not contain a component isomorphic to K2 can be weighted from the set {1,...,30} such that in the resulting vertex ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
A weighting w of the edges of a graph G induces a colouring of the vertices of G where the colour of vertex v, denoted cv, is ∑ w(e). We show that the edges of every graph that e∋v does not contain a component isomorphic to K2 can be weighted from the set {1,...,30} such that in the resulting
On the TwoConnected Planar Spanning Subgraph Polytope
, 1996
"... The problem of finding in a complete edgeweighted graph a twoconnected planar spanning subgraph of maximum weight is important in automatic graph drawing. We investigate the problem from a polyhedral point of view. ..."
Abstract
 Add to MetaCart
The problem of finding in a complete edgeweighted graph a twoconnected planar spanning subgraph of maximum weight is important in automatic graph drawing. We investigate the problem from a polyhedral point of view.
X: A note on singlelinkage equivalence
 Appl Math Lett
"... We introduce the concept of singlelinkage equivalence of edgeweighted graphs, we apply it to characterise maximal spanning trees and “ultrasimilarities”, and we discuss how it relates to the popular singlelinkage clustering algorithm. Key words and phrases: Edgeweighted graphs, singlelinkage cl ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We introduce the concept of singlelinkage equivalence of edgeweighted graphs, we apply it to characterise maximal spanning trees and “ultrasimilarities”, and we discuss how it relates to the popular singlelinkage clustering algorithm. Key words and phrases: Edgeweighted graphs, single
Results 11  20
of
273,519