871 search results - page 127 / 175 » The vertex-cover polynomial of a graph |
ISAAC
2009
Springer
15 years 4 months ago
2009
Springer
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
120
click to vote
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
This paper considers a relay-assisted bidirectional cellular network where the base station (BS) communicates with each mobile station (MS) using orthogonal frequencydivision multi...
CATS
2008
14 years 11 months ago
2008
We study the consistency problem for extended global cardinality (EGC) constraints. An EGC constraint consists of a set X of variables, a set D of values, a domain D(x) D for eac...
DAC
2003
ACM
15 years 10 months ago
2003
ACM
Delay budget is an excess delay each component of a design can tolerate under a given timing constraint. Delay budgeting has been widely exploited to improve the design quality. W...