Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

76

Voted

JCT
2008

61views more JCT 2008»

Enumerating split-pair arrangements

15 years 2 months ago

Enumerating split-pair arrangements

Download cseweb.ucsd.edu

An arrangement of the multi-set {1, 1, 2, 2, . . . , n, n} is said to be "split-pair"

Ronald L. Graham, Nan Zang

Real-time Traffic

JCT 2008 | Multi-set |

claim paper

Related Content

» A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra

» Complete combinatorial generation of small point configurations and hyperplane arrangement...

» Multitriangulations pseudotriangulations and primitive sorting networks

» On Computing the Centroid of the Vertices of an Arrangement and Related Problems

» Enumeration in Convex Geometries and Associated Polytopal Subdivisions of Spheres

» On the Number of Arrangements of Pseudolines

» Arrangements of double pseudolines

» On optimal anonymization for ldiversity

» Noise minimization during powerup stage for a multidomain power network

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2008
Where	JCT
Authors	Ronald L. Graham, Nan Zang

Comments (0)