646 search results - page 26 / 130 » Generalized connected domination in graphs |
105
click to vote
JCT
2010
14 years 10 months ago
2010
A graph G on n vertices is Hamiltonian if it contains a cycle of length n and pancyclic if it contains cycles of length for all 3 ≤ ≤ n. Write α(G) for the independence numbe...
101
click to vote
CIKM
2009
Springer
15 years 3 months ago
2009
Springer
We study query processing in large graphs that are fundamental data model underpinning various social networks and Web structures. Given a set of query nodes, we aim to find the g...
115
click to vote
INFOCOM
2010
IEEE
14 years 9 months ago
2010
IEEE
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
FS
2006
14 years 11 months ago
2006
General deviation measures are introduced and studied systematically for their potential applications to risk management in areas like portfolio optimization and engineering. Such...
125
click to vote
NMR
2004
Springer
15 years 5 months ago
2004
Springer
One of the crucial actions any reasoning system must undertake is the updating of its Knowledge Base (KB). This problem is usually referred to as the problem of belief change. The...