4865 search results - page 330 / 973 » The Complexity of Graph Connectivity |
212
click to vote
EUROGP
2008
Springer
15 years 8 months ago
2008
Springer
Two prominent genetic programming approaches are the graph-based Cartesian Genetic Programming (CGP) and Linear Genetic Programming (LGP). Recently, a formal algorithm for construc...
124
click to vote
CACM
2008
15 years 6 months ago
2008
In this article, we study the problem of distributed selection from a theoretical point of view. Given a general connected graph of diameter D consisting of n nodes in which each ...
165
click to vote
COMBINATORICS
2007
15 years 6 months ago
2007
A simple 2-matching in a graph is a subgraph all of whose nodes have degree 1 or 2. A simple 2-matching is called k-restricted if every connected component has > k edges. We co...
182
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...
157
click to vote
SIGMETRICS
2005
ACM
16 years 8 days ago
2005
ACM
—To model P2P networks that are commonly faced with high rates of churn and random departure decisions by end-users, this paper investigates the resilience of random graphs to li...