3008 search results - page 333 / 602 » Independence in connected graphs |
163
click to vote
IPCO
2007
15 years 8 months ago
2007
Consider the following Steiner Tree leasing problem. Given a graph G = (V, E) with root r, and a sequence of terminal sets Dt ⊆ V for each day t ∈ [T]. A feasible solution to t...
158
click to vote
ISCI
2007
15 years 6 months ago
2007
In this paper, we explore the 2-extra connectivity and 2-extra-edge-connectivity of the folded hypercube FQn. We show that j2(FQn) = 3n À 2 for n P 8; and k2(FQn) = 3n À 1 for n...
163
click to vote
ICWE
2010
Springer
15 years 5 months ago
2010
Springer
Inspired by the Google Wonder Wheel1 , in this paper we present Semantic Wonder Cloud (SWOC): a tool that helps users in knowledge exploration within the DBpedia dataset by adoptin...
187
click to vote
JUCS
2010
15 years 5 months ago
2010
: River Formation Dynamics (RFD) is an evolutionary computation method based on copying how drops form rivers by eroding the ground and depositing sediments. Given a cost-evaluated...
238
click to vote
IPMI
2011
Springer
14 years 10 months ago
2011
Springer
In this paper we construct an atlas that captures functional characteristics of a cognitive process from a population of individuals. The functional connectivity is encoded in a lo...