966 search results - page 93 / 194 » Small Alliances in Graphs |
STOC
2003
ACM
14 years 10 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
SDM
2009
SIAM
14 years 7 months ago
2009
SIAM
The increasing availability of network data is creating a great potential for knowledge discovery from graph data. In many applications, feature vectors are given in addition to g...
ICNP
2009
IEEE
14 years 4 months ago
2009
IEEE
—Recently, there has been much renewed interest in developing compact data structures for packet processing functions such as longest prefix-match for IP lookups. This has been ...
ER
2007
Springer
14 years 4 months ago
2007
Springer
Provability-based semantic interoperability (PBSI) is a kind of interoperability that transcends mere syntactic translation to allow for robust, meaningful information exchange acr...
WADS
2007
Springer
14 years 4 months ago
2007
Springer
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...