356 search results - page 5 / 72 » A Most General Edge Elimination Polynomial - Thickening of E... |
CORR
2007
Springer
14 years 10 months ago
2007
Springer
We define a multivariate polynomial that generalizes in a unified way the twovariable interlace polynomial defined by Arratia, Bollob´as and Sorkin on the one hand, and a one-...
117
click to vote
ISPDC
2005
IEEE
15 years 3 months ago
2005
IEEE
Abstract— In this article, we propose a fully distributed algorithm for finding all primes in an given interval [2..n] (or (L, R), more generally), based on the SMER — Schedul...
GD
2008
Springer
14 years 11 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...
CCCG
2007
14 years 11 months ago
2007
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...
69
Voted
WWW
2003
ACM
15 years 10 months ago
2003
ACM
As dynamic content becomes increasingly dominant, it becomes an important research topic as how the edge resources such as client-side proxies, which are otherwise underutilized f...