365 search results - page 56 / 73 » On the combinatorics of Galois numbers |
79
Voted
COCOON
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. An undirected graph G = (V, E) is the k-power of an undirected tree T = (V, E ) if (u, v) ∈ E iff u and v are connected by a path of length at most k in T. The tree T ...
CPM
2005
Springer
15 years 5 months ago
2005
Springer
A square is the concatenation of two identical non-empty strings. Let S be the input string which is given character by character. Let m be the (unknown) smallest integer such that...
COMPGEOM
2007
ACM
15 years 3 months ago
2007
ACM
We prove an optimal generalization of the centerpoint theorem: given a set P of n points in the plane, there exist two points (not necessarily among input points) that hit all con...
174
click to vote
AB
2008
Springer
15 years 1 months ago
2008
Springer
In 2007, Eickmeyer et al. showed that the tree topologies outputted by the Neighbor-Joining (NJ) algorithm and the balanced minimum evolution (BME) method for phylogenetic reconstr...
DCG
2010
14 years 12 months ago
2010
Abstract. Recently a curvature theory for polyhedral surfaces has been established which associates with each face a mean curvature value computed from areas and mixed areas of tha...