Long non-crossing configurations in the plane

DOI10.1007/S00454-010-9277-9zbMATH Open1207.68416OpenAlexW2109075893MaRDI QIDQ603879FDOQ603879

Authors Adrian Dumitrescu, Csaba D. Tóth 

Publication date 8 November 2010

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00454-010-9277-9

zbMATH Keywords

approximation algorithmnon-crossingHamiltonian cycle problemHamiltonian path problemmaximization problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55) Paths and cycles (05C38)

Recommendations

• Long non-crossing configurations in the plane
• scientific article; zbMATH DE number 741010
• Bounds on the maximum multiplicity of some common geometric graphs
• Bottleneck non-crossing matching in the plane
• Bounds on the maximum multiplicity of some common geometric graphs

Cites work

• scientific article; zbMATH DE number 3160756 (Why is no real title available?)
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 1305423 (Why is no real title available?)
• scientific article; zbMATH DE number 741010 (Why is no real title available?)
• scientific article; zbMATH DE number 1424297 (Why is no real title available?)
• scientific article; zbMATH DE number 1424303 (Why is no real title available?)
• scientific article; zbMATH DE number 1424307 (Why is no real title available?)
• scientific article; zbMATH DE number 3368644 (Why is no real title available?)
• scientific article; zbMATH DE number 3407703 (Why is no real title available?)
• Bipartite embeddings of trees in the plane
• Edge-removal and non-crossing configurations in geometric graphs
• Encompassing colored planar straight line graphs
• Improved bounds for planar \(k\)-sets and related problems
• Noncrossing Hamiltonian paths in geometric graphs
• On the number of line separations of a finite set in the plane
• Point sets with many \(k\)-sets
• Ramsey-type results for geometric graphs. I
• Ramsey-type results for geometric graphs. II

Cited in

(11)

• Maximum plane trees in multipartite geometric graphs
• New variants of perfect non-crossing matchings
• Euclidean maximum matchings in the plane -- local to global
• Configurations of non-crossing rays and related problems
• Euclidean maximum matchings in the plane -- local to global
• On the heaviest increasing or decreasing subsequence of a permutation, and paths and matchings on weighted point sets
• Non-crossing Hamiltonian paths and cycles in output-polynomial time
• Large harmonic sets of noncrossing edges for n randomly labeled vertices in convex position
• Long non-crossing configurations in the plane
• scientific article; zbMATH DE number 741010 (Why is no real title available?)
• Non-crossing Hamiltonian paths and cycles in output-polynomial time

This page was built for publication: Long non-crossing configurations in the plane

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