601 search results - page 99 / 121 » Edge-dominating cycles in graphs |
161
click to vote
STOC
2003
ACM
16 years 6 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...
209
click to vote
SI3D
2003
ACM
15 years 11 months ago
2003
ACM
In this paper we develop an interactive 3D browser for large topographic maps using a visual display augmented by a haptic, or force feedback, display. The extreme size of our dat...
162
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
183
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Analyzing differential-gene-expression data in the context of protein-interaction networks (PINs) yields information on the functional cellular status. PINs can be for...
150
click to vote
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
Triangle strips have been widely used for efficient rendering. It is NP-complete to test whether a given triangulated model can be represented as a single triangle strip, so many...