303 search results - page 13 / 61 » Computing Minimal Spanning Subgraphs in Linear Time |
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
CSR
2008
Springer
13 years 9 months ago
2008
Springer
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
ECCV
1994
Springer
14 years 9 months ago
1994
Springer
Abstract. This paper de nes a temporal continuity constraint that expresses assumptions about the evolution of 2D image velocity, or optical ow, over a sequence of images. Temporal...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
AINA
2008
IEEE
14 years 2 months ago
2008
IEEE
The analysis of gene expression time series obtained from microarray experiments can be effectively exploited to understand a wide range of biological phenomena from the homeostat...