1493 search results - page 59 / 299 » Local resilience of graphs |
112
click to vote
GECCO
2003
Springer
15 years 5 months ago
2003
Springer
We present a new Immune Algorithm that incorporates a simple local search procedure to improve the overall performances to tackle the graph coloring problem instances. We character...
84
Voted
DM
2006
15 years 18 days ago
2006
Let G be a connected, locally connected, claw-free graph of order n and x, y be two vertices of G. In this paper, we prove that if for any 2-cut S of G, S {x, y} = , then each (x...
70
Voted
EJC
2006
15 years 18 days ago
2006
A class C of graphs is said to be H-bounded if each graph in the class C admits a homomorphism to H. We give a general necessary and sufficient condition for the existence of boun...
117
Voted
GBRPR
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. In this paper, we propose a novel method for the unsupervised clustering of graphs in the context of the constellation approach to object recognition. Such method is an E...
65
Voted
JGT
2006
15 years 16 days ago
2006
: A graph has the neighbor-closed-co-neighbor, or ncc property, if for each of its vertices x, the subgraph induced by the neighbor set of x is isomorphic to the subgraph induced b...