2069 search results - page 285 / 414 » Linear time algorithms for Clobber |
169
click to vote
GD
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. We present a linear-time algorithm for solving the simultaneous embedding problem with fixed edges (SEFE) for a planar graph and a pseudoforest (a graph with at most one...
174
click to vote
DEXA
2010
Springer
15 years 6 months ago
2010
Springer
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
122
click to vote
TSP
2008
15 years 6 months ago
2008
A new family of methods, named phase estimation using polyspectrum slices (PEP), for the reconstruction of the Fourier phase of a complex linear time invariant (LTI) system excited...
170
click to vote
COMPGEOM
1993
ACM
15 years 10 months ago
1993
ACM
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
150
click to vote
AAAI
1998
15 years 7 months ago
1998
Temporal plans permit significant flexibility in specifying the occurrence time of events. Plan execution can make good use of that flexibility. However, the advantage of executio...