138 search results - page 22 / 28 » Bisimplicial Edges in Bipartite Graphs |
STOC
2003
ACM
16 years 3 days 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...
DM
2008
14 years 12 months ago
2008
Let G = (V, E) be a graph. A set S V is a restrained dominating set if every vertex not in S is adjacent to a vertex in S and to a vertex in V - S. The restrained domination numb...
100
click to vote
ENDM
2002
14 years 11 months ago
2002
A graph G homogeneously embeds in a graph H if for every vertex x of G and every vertex y of H there is an induced copy of G in H with x at y. The graph G uniformly embeds in H if...
SIGIR
2008
ACM
14 years 11 months ago
2008
ACM
We present a novel passage-based approach to re-ranking documents in an initially retrieved list so as to improve precision at top ranks. While most work on passage-based document...
CPC
2007
14 years 11 months ago
2007
Consider two graphs G1 and G2 on the same vertex set V and suppose that Gi has mi edges. Then there is a bipartition of V into two classes A and B so that for both i = 1, 2 we hav...