356 search results - page 44 / 72 » A Most General Edge Elimination Polynomial - Thickening of E... |
100
click to vote
FOCS
1999
IEEE
15 years 4 months ago
1999
IEEE
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
126
Voted
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
143
click to vote
COMPGEOM
2010
ACM
15 years 5 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 ...
109
Voted
WG
1994
Springer
15 years 4 months ago
1994
Springer
The goal of a fugitive-search game on a graph is to trap a fugitive that hides on the vertices of the graph by systematically placing searchers on the vertices. The fugitive is as...
112
click to vote
SIAMSC
2010
14 years 7 months ago
2010
Abstract. BDDC algorithms are constructed and analyzed for the system of almost incompressible elasticity discretized with Gauss-Lobatto-Legendre spectral elements in three dimensi...