Results 1  10
of
6,991
An Eigendecomposition Approach to Weighted Graph Matching Problems
, 1988
"... This paper discusses an approximate solution to the weighted graph matching prohlem (WGMP) for both undirected and directed graphs. The WGMP is the problem of f inding the optimum matching between two weighted graphs, which are graphs with weights at each arc. The proposed method employs an analytic ..."
Abstract

Cited by 202 (0 self)
 Add to MetaCart
This paper discusses an approximate solution to the weighted graph matching prohlem (WGMP) for both undirected and directed graphs. The WGMP is the problem of f inding the optimum matching between two weighted graphs, which are graphs with weights at each arc. The proposed method employs
On Unique Independence Weighted Graphs
, 2009
"... An independent set in a graph G is a set of vertices no two of which are joined by an edge. A vertexweighted graph associates a weight with every vertex in the graph. A vertexweighted graph G is called a unique independence vertexweighted graph if it has a unique independent set with maximum sum ..."
Abstract
 Add to MetaCart
An independent set in a graph G is a set of vertices no two of which are joined by an edge. A vertexweighted graph associates a weight with every vertex in the graph. A vertexweighted graph G is called a unique independence vertexweighted graph if it has a unique independent set with maximum
Displacements of Weighted Graphs
 THE 27TH WORKSHOP ON COMBINATORIAL MATHEMATICS AND COMPUTATION THEORY
"... In this paper we investigate the relationship between the status and the displacement of a connected weighted graph. We also obtain a product result for the displacements. ..."
Abstract
 Add to MetaCart
In this paper we investigate the relationship between the status and the displacement of a connected weighted graph. We also obtain a product result for the displacements.
Compression of Weighted Graphs
"... 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 superedg ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
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
Annals of Distances in Weighted Graphs
, 2014
"... Abstract. The concept of distance is one of the basic concepts in Mathematics. How far two objects (vertices) are apart in a discrete structure is of interest, both theoretically and for its applications. Since discrete structures are naturally modeled by graphs, this leads us to studying distance i ..."
Abstract
 Add to MetaCart
in graphs. Starting from Menger, an explosion of interest in finite metric spaces occurred. Now finite distance metric have become an essential tool in many areas of Mathematics. This paper discussing about four distances in weighted graphs, namely  distance , strong geodesic distance , strongest strong
Birational transformations of weighted graphs
 In Affine algebraic geometry
, 2007
"... Abstract. We introduce the notion of a standard weighted graph and show that every weighted graph has an essentially unique standard model. Moreover we classify birational transformations between such models. Our central result shows that these are composed of elementary transformations. The latter ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. We introduce the notion of a standard weighted graph and show that every weighted graph has an essentially unique standard model. Moreover we classify birational transformations between such models. Our central result shows that these are composed of elementary transformations
Reconstruction of Weighted Graphs By Their Spectrum
 Eur J Comb
"... It will be shown that for almost all weights one can reconstruct a weighted graph from its spectrum. This result is the opposite to the wellknown theorem of Botti and Merris which states that reconstruction of nonweighted graphs is in general impossible since almost all (nonweighted) trees share ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
It will be shown that for almost all weights one can reconstruct a weighted graph from its spectrum. This result is the opposite to the wellknown theorem of Botti and Merris which states that reconstruction of nonweighted graphs is in general impossible since almost all (nonweighted) trees share
On the Enumeration of Certain Weighted Graphs
, 2008
"... We enumerate weighted graphs with a certain upper bound condition. We also compute the generating function of the numbers of these graphs, and prove that it is a rational function. In particular, we show that if the given graph is a bipartite graph, then its generating function is of the form p(x) ( ..."
Abstract
 Add to MetaCart
We enumerate weighted graphs with a certain upper bound condition. We also compute the generating function of the numbers of these graphs, and prove that it is a rational function. In particular, we show that if the given graph is a bipartite graph, then its generating function is of the form p
Consistent Weighted Graph Layouts
"... Abstract. A graph layout is a geometrical representation of a graph such that the vertexes are assigned points and the edges become line segments. In this paper we present two probabilistic algorithms that build layouts for weighted graphs such that the geometrical distances between the vertexes are ..."
Abstract
 Add to MetaCart
Abstract. A graph layout is a geometrical representation of a graph such that the vertexes are assigned points and the edges become line segments. In this paper we present two probabilistic algorithms that build layouts for weighted graphs such that the geometrical distances between the vertexes
Results 1  10
of
6,991