230 search results - page 9 / 46 » Time Varying Undirected Graphs |
100
click to vote
SIGMETRICS
2010
ACM
14 years 9 months ago
2010
ACM
Graph theory provides a powerful set of metrics and conceptual ideas to model and investigate the behavior of communication networks. Most graph-theoretical frameworks in the netw...
GECCO
2008
Springer
15 years 13 days ago
2008
Springer
A new evolutionary method named “Genetic Network Programming with Control Nodes, GNPcn” has been proposed and applied to determine the timing of buying and selling stocks. GNP...
DM
2008
14 years 11 months ago
2008
In this paper we present an algorithm to generate all minimal 3-vertex connected spanning subgraphs of an undirected graph with n vertices and m edges in incremental polynomial tim...
CORR
2011
Springer
14 years 6 months ago
2011
Springer
We consider a consensus algorithm in which every node in a time-varying undirected connected graph assigns equal weight to each of its neighbors. Under the assumption that the deg...
101
click to vote
PAKDD
2007
ACM
15 years 5 months ago
2007
ACM
This work presents a kernel method for clustering the nodes of a weighted, undirected, graph. The algorithm is based on a two-step procedure. First, the sigmoid commute-time kernel...