scientific article; zbMATH DE number 741010

MaRDI QIDQ4327375zbMATH OpenFDO

Authors Noga Alon, Sridhar Rajagopalan, Subhash Suri

Publication date 5 April 1995

zbMATH Keywords

crossing matchinggeometric maximization problems

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Recommendations

• Long non-crossing configurations in the plane
• Long non-crossing configurations in the plane
• Bottleneck non-crossing matching in the plane
• Bottleneck non-crossing matching in the plane
• Faster bottleneck non-crossing matchings of points in convex position

Cited in

(17)

• Efficient labelling algorithms for the maximum noncrossing matching problem
• Faster bottleneck non-crossing matchings of points in convex position
• Configurations of non-crossing rays and related problems
• Long non-crossing configurations in the plane
• Large harmonic sets of noncrossing edges for n randomly labeled vertices in convex position
• On the heaviest increasing or decreasing subsequence of a permutation, and paths and matchings on weighted point sets
• Crossing matchings and circuits have maximal length
• Maximum plane trees in multipartite geometric graphs
• Long non-crossing configurations in the plane
• New variants of perfect non-crossing matchings
• Non-crossing Hamiltonian paths and cycles in output-polynomial time
• Euclidean maximum matchings in the plane -- local to global
• Noncrossing longest paths and cycles
• Noncrossing longest paths and cycles
• Crossing and independent families among polygons
• New variants of perfect non-crossing matchings
• Euclidean maximum matchings in the plane -- local to global

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4327375)