On a triangle counting problem
From MaRDI portal
Publication:909463
DOI10.1016/0020-0190(90)90217-LzbMath0694.68036OpenAlexW1977761102MaRDI QIDQ909463
Joseph S. B. Mitchell, Samir Khuller
Publication date: 1990
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(90)90217-l
Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99) Enumerative combinatorics (05A99)
Related Items
Computing colourful simplicial depth and Median in \(\mathbb{R}_2\) ⋮ Enumerating trichromatic triangles containing the origin in linear time ⋮ FITTING A STEP FUNCTION TO A POINT SET WITH OUTLIERS BASED ON SIMPLICIAL THICKNESS DATA STRUCTURES ⋮ Counting convex polygons in planar point sets ⋮ On Liu's simplicial depth and Randles' interdirections ⋮ Algorithms for bivariate medians and a Fermat-Torricelli problem for lines. ⋮ Algorithms for Colourful Simplicial Depth and Medians in the Plane ⋮ Crossing-Free Perfect Matchings in Wheel Point Sets ⋮ From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices ⋮ FINDING SIMPLICES CONTAINING THE ORIGIN IN TWO AND THREE DIMENSIONS ⋮ Counting \(k\)-subsets and convex \(k\)-gons in the plane ⋮ Algorithms for bivariate zonoid depth ⋮ Counting convex \(k\)-gons in planar point sets ⋮ Geometric medians
Cites Work
