35 search results - page 3 / 7 » Fast discovery of connection subgraphs |
ICOIN
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. In this paper we present the set of base algorithms for generating connected random graphs (RG). RG can be used for testing different algorithms on networks. The fast al...
SSDBM
2010
IEEE
13 years 4 months ago
2010
IEEE
Currently, a large amount of data can be best represented as graphs, e.g., social networks, protein interaction networks, etc. The analysis of these networks is an urgent research ...
ESA
2010
Springer
13 years 7 months ago
2010
Springer
Minor containment is a fundamental problem in Algorithmic Graph Theory, as numerous graph algorithms use it as a subroutine. A model of a graph H in a graph G is a set of disjoint ...
APPROX
2000
Springer
13 years 10 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
MOBIHOC
2000
ACM
13 years 10 months ago
2000
ACM
Bluetooth is a promising new technology that enables portable devices to form short-range wireless ad hoc networks and relies on spread spectrum frequency hopping (FH) techniques f...