Maximum k-chains in planar point sets

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Maximum k-chains in planar point sets: combinatorial structure and algorithms

Full text

Pdf (760 KB)

Source

Annual ACM Symposium on Theory of Computing archive
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing table of contents

San Diego, California, United States

Pages: 146 - 153

Year of Publication: 1993

ISBN:0-89791-591-7

Authors

Stefan Felsner
Lorenz Wernisch

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 8, Citation Count: 0

Additional Information:

references index terms collaborative colleagues peer to peer

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/167088.167136 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	Fre75	M.L. Fredman. On computing the length of longest increasing subsequences. Discr. Math., 11:29-35, 1975.
	Gav87	F. Gavril, Algorithms for maximum k-colorings and k-coverings of transitive graphs, Networks, v.17 n.4, p.465-470, Winter 1987 [doi>10.1002/net.3230170407]
	GK76	C. Greene and D. J. Kleitman. The structure of sperner k-families. J. Comb. Th. (A), 20:41- 68, 1976.
	Gre74	C. Greene. An extension of Schensted's theorem. Adv. in Math., 14:254-265, 1974.
	Gre76	C. Greene. Some partitions associated with a partially ordered set. J. Comb. Th. (A), 20:69-- 79, 1976.
	Knu73	Donald E. Knuth, The art of computer programming, volume 3: (2nd ed.) sorting and searching, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1998
	LS92	Ruey-der Lou , Majid Sarrafzadeh, An optimal algorithm for the maximum three-chain problem, SIAM Journal on Computing, v.22 n.5, p.976-993, Oct. 1993 [doi>10.1137/0222060]
	LSL90	R. D. Lou , M. Sarrafzadeh , D. T. Lee, An optimal algorithm for the maximum two-chain problem, Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, p.149-158, January 22-24, 1990, San Francisco, California, United States
	MW92	Jiří Matoušek , Emo Welzl, Good splitters for counting points in triangles, Journal of Algorithms, v.13 n.2, p.307-319, June, 1992 [doi>10.1016/0196-6774(92)90021-4]
	Sch61	C. Schensted. Longest increasing and decreasing sequences. Canad. J. Math., 13:179-191, 1961.
	SL93	M. Sarrafzadeh and R. D. Lou. Maximum kcovering of weighted transitive graphs with applications. Algorithmica, 9:84-100, 1993.
	vEB77	P. van Erode Boas. Preserving order in a forest in less than logarithmic time and linear space. Inf. Proc. Letters, 6:80-82, 1977.
	Vie77	G. Viennot. Une forme g@om@trique de la correspondance de Robinson-Schenstedt. In D. Foata, editor, Combinatozre et Reprdsentalion du Groupe Symgtrique, pages 29-58. Lecture Notes in Mathematics 579, Berlin Heidelberg New York, 1977.
	Vie84	G. Viennot. Chain and antichain families, grids and young tableaux. In Orders: Description and Roles, pages 409-463. North-Holland Math. Stud. 99, Amsterdam New York, 1984.