Results 1  10
of
1,463,417
Republic of China HEAVY PATHS AND CYCLES IN WEIGHTED GRAPHS ∗
, 1998
"... A weighted graph is a graph in which each edge e is assigned a nonnegative number w(e), called the weight of e. In this paper, some theorems on the existence of long paths and cycles in unweighted graphs are generalized to heavy paths and cycles in weighted graphs. ..."
Abstract
 Add to MetaCart
A weighted graph is a graph in which each edge e is assigned a nonnegative number w(e), called the weight of e. In this paper, some theorems on the existence of long paths and cycles in unweighted graphs are generalized to heavy paths and cycles in weighted graphs.
CYCLES IN WEIGHTED GRAPHS AND RELATED TOPICS
"... photography or any other means without the permission ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
photography or any other means without the permission
Weighted Degrees and Heavy Cycles in Weighted Graphs
, 2009
"... A weighted graph is a graph provided with an edgeweighting function w from the edge set to nonnegative real numbers. Bondy and Fan [Annals of Discrete Math. 41 (1989), 53– 69] began the study on the existence of heavy cycles in weighted graphs. Though several results with Diractype degree conditio ..."
Abstract
 Add to MetaCart
A weighted graph is a graph provided with an edgeweighting function w from the edge set to nonnegative real numbers. Bondy and Fan [Annals of Discrete Math. 41 (1989), 53– 69] began the study on the existence of heavy cycles in weighted graphs. Though several results with Diractype degree
A note on heavy cycles in weighted graphs
"... In [2], Bondy and Fan proved the existence of heavy cycle with Diractype weighted degree condition. And in [1], a similar result with Oretype weighted degree condition is proved, however the conclusion is weaker than the one in [2]. Here we unify these two results, using a weighted degree conditio ..."
Abstract
 Add to MetaCart
In [2], Bondy and Fan proved the existence of heavy cycle with Diractype weighted degree condition. And in [1], a similar result with Oretype weighted degree condition is proved, however the conclusion is weaker than the one in [2]. Here we unify these two results, using a weighted degree
Claw Conditions for Heavy Cycles in Weighted Graphs
, 2004
"... A graph is called a weighted graph when each edge e is assigned a nonnegative number w(e), called the weight of e. For a vertex v of a weighted graph, d w (v) is the sum of the weights of the edges incident with v. For a subgraph H of a weighted graph G, the weight of H is the sum of the weights of ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
of the edges belonging to H. In this paper, we give a new sufficient condition for a weighted graph to have a heavy cycle. A 2connected weighted graph G contains either a Hamilton cycle or a cycle of weight at least c, if G satisfies the following conditions: In every induced claw or induced modified claw F
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
Locally weighted learning
 ARTIFICIAL INTELLIGENCE REVIEW
, 1997
"... This paper surveys locally weighted learning, a form of lazy learning and memorybased learning, and focuses on locally weighted linear regression. The survey discusses distance functions, smoothing parameters, weighting functions, local model structures, regularization of the estimates and bias, ass ..."
Abstract

Cited by 594 (53 self)
 Add to MetaCart
This paper surveys locally weighted learning, a form of lazy learning and memorybased learning, and focuses on locally weighted linear regression. The survey discusses distance functions, smoothing parameters, weighting functions, local model structures, regularization of the estimates and bias
Factor Graphs and the SumProduct Algorithm
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 1998
"... A factor graph is a bipartite graph that expresses how a "global" function of many variables factors into a product of "local" functions. Factor graphs subsume many other graphical models including Bayesian networks, Markov random fields, and Tanner graphs. Following one simple c ..."
Abstract

Cited by 1787 (72 self)
 Add to MetaCart
A factor graph is a bipartite graph that expresses how a "global" function of many variables factors into a product of "local" functions. Factor graphs subsume many other graphical models including Bayesian networks, Markov random fields, and Tanner graphs. Following one simple
A Framework for Dynamic Graph Drawing
 CONGRESSUS NUMERANTIUM
, 1992
"... Drawing graphs is an important problem that combines flavors of computational geometry and graph theory. Applications can be found in a variety of areas including circuit layout, network management, software engineering, and graphics. The main contributions of this paper can be summarized as follows ..."
Abstract

Cited by 627 (44 self)
 Add to MetaCart
Drawing graphs is an important problem that combines flavors of computational geometry and graph theory. Applications can be found in a variety of areas including circuit layout, network management, software engineering, and graphics. The main contributions of this paper can be summarized
Results 1  10
of
1,463,417