1075 search results - page 20 / 215 » Calculating the Number of Tunnels |
FSTTCS
2006
Springer
14 years 3 days ago
2006
Springer
Abstract. In this paper we construct fixed finite tile systems that assemble into particular classes of shapes. Moreover, given an arbitrary n, we show how to calculate the tile co...
MOC
2000
13 years 8 months ago
2000
Given an odd prime p we show a way to construct large families of polynomials Pq(x) Q[x], q C, where C is a set of primes of the form q 1 mod p and Pq(x) is the irreducible poly...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We propose a new measure that quantifies the "closeness" between two nodes in a given graph. The calculation of the measure is linear in the number of edges in the graph...
CIAC
2010
Springer
14 years 1 months ago
2010
Springer
Higher order Delaunay triangulations are a generalization of the Delaunay triangulation which provides a class of well-shaped triangulations, over which extra criteria can be optim...
EM
2010
13 years 8 months ago
2010
On the punctured torus the number of essential self-intersections of a homotopy class of closed curves is bounded (sharply) by a quadratic function of its combinatorial length (th...