359 search results - page 9 / 72 » On the number of chord diagrams |
JCT
2010
14 years 10 months ago
2010
The pattern-avoiding fillings of Young diagrams we study arose from Postnikov’s work on positive Grassman cells. They are called Γ -diagrams, and are in bijection with decorate...
123
click to vote
ALGORITHMICA
2004
14 years 11 months ago
2004
We study the Hausdorff Voronoi diagram of point clusters in the plane, a generalization of Voronoi diagrams based on the Hausdorff distance function. We derive a tight combinatori...
COMBINATORICS
1998
14 years 11 months ago
1998
An n-Venn diagram is a collection of n finitely-intersecting simple closed curves in the plane, such that each of the 2n sets X1 ∩X2 ∩· · ·∩Xn, where each Xi is the open...
FCS
2006
15 years 1 months ago
2006
In this paper, we concentrate on the problem of computing a Voronoi diagram using Hypercube model of computation. The main contribution of this work is the O(log3 n) parallel algor...
CCCG
2008
15 years 1 months ago
2008
We study the problem of computing Voronoi diagrams distributedly for a set of nodes of a network modeled as a Unit Disk Graph (UDG). We present an algorithm to solve this problem ...