ICALP
2010
Springer
13 years 6 months ago
2010
Springer
Given a connected graph G and a failure probability pe for each edge e in G, the reliability of G is the probability that G remains connected when each edge e is removed independe...
ICPP
1995
IEEE
13 years 8 months ago
1995
IEEE
If G is a connected graph with N nodes, its r dimensional product contains Nr nodes. We present an algorithm which sorts Nr keys stored in the rdimensional product of any graph G ...
GECCO
2000
Springer
13 years 8 months ago
2000
Springer
We generalize Holland's Schema Theorem to the setting that genes are arranged, not necessarily in a linear sequence, but as the nodes in a connected graph. We have experiment...
ISAAC
2009
Springer
13 years 9 months ago
2009
Springer
For a connected graph G = (V, E), a subset U ⊆ V is called a k-cut if U disconnects G, and the subgraph induced by U contains exactly k (≥ 1) components. More specifically, a ...
IPMI
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. In this paper we propose a novel approach to define task-driven regularization constraints in deformable image registration using learned deformation priors. Our method ...
FUN
2010
Springer
13 years 9 months ago
2010
Springer
The Honey-Bee game is a two-player board game that is played on a connected hexagonal colored grid, or in a generalized setting, on a connected graph with colored nodes. In a singl...
ISAAC
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. The rendezvous problem in graphs has been extensively studied in the literature, mainly using a randomized approach. Two mobile agents have to meet at some node of a conn...
STACS
2009
Springer
13 years 11 months ago
2009
Springer
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted ...