scientific article; zbMATH DE number 6469209

MaRDI QIDQ5501327zbMATH OpenFDO

Authors Vladlen Koltun, Pankaj K. Agarwal, Boris Aronov

Publication date 3 August 2015

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Nonnumerical algorithms (68W05)

Recommendations

• Efficient algorithms for bichromatic separability
• Polynomial time algorithms for bichromatic problems
• Bichromatic separability with two boxes: A general approach
• Algorithms for edge coloring bipartite graphs
• Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs
• scientific article; zbMATH DE number 4087683
• Efficient Sequential and Parallel Algorithms for Maximal Bipartite Sets
• Space-efficient Euler partition and bipartite edge coloring
• Space-Efficient Euler Partition and Bipartite Edge Coloring
• Efficient algorithms for acyclic colorings of graphs

Cited in

(6)

• Geometric separability using orthogonal objects
• Efficient algorithms for bichromatic separability
• Red-blue separability problems in 3D
• SOME LOWER BOUNDS ON GEOMETRIC SEPARABILITY PROBLEMS
• RED-BLUE SEPARABILITY PROBLEMS IN 3D
• Separating bichromatic point sets by L-shapes

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 Q5501327)