4865 search results - page 444 / 973 » The Complexity of Graph Connectivity |
149
click to vote
COCOON
2005
Springer
16 years 13 days ago
2005
Springer
Abstract. An undirected graph G = (V, E) is the k-power of an undirected tree T = (V, E ) if (u, v) ∈ E iff u and v are connected by a path of length at most k in T. The tree T ...
174
click to vote
PCI
2005
Springer
16 years 12 days ago
2005
Springer
In this paper, we present the rationale and the baseline of a notation which can be used on its own or as an extension to standard UML to facilitate specification of an interactive...
180
Voted
RSFDGRC
2005
Springer
16 years 12 days ago
2005
Springer
In this paper, a new variant of Bagging named DepenBag is proposed. This algorithm obtains bootstrap samples at first. Then, it employs a causal discoverer to induce from each sam...
164
click to vote
ADHOCNOW
2003
Springer
16 years 4 days ago
2003
Springer
We consider topology control problems where the goal is to assign transmission powers to the nodes of an ad hoc network so as to induce graphs satisfying specific properties. The ...
164
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
— In this paper, we study the dynamics of a viral spreading process in random geometric graphs (RGG). The spreading of the viral process we consider in this paper is closely rela...