Minimum consistent subset problem for trees

DOI10.1007/978-3-030-86593-1_14zbMath1497.68376OpenAlexW3198964105MaRDI QIDQ2140499

Subhas C. Nandy, Sanjana Dey, Anil Maheshwari

Publication date: 20 May 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-86593-1_14

zbMATH Keywords

graphstreesoptimal algorithmconsistent subset

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Minimum consistent subset of simple graph classes

Cites Work

• Minimum consistent subset of simple graph classes
• The inverse Voronoi problem in graphs. I: Hardness
• Algorithms and hardness results for nearest neighbor problems in bicolored point sets
• Consistent subset problem with two labels
• The inverse Voronoi problem in graphs. II: Trees
• An algorithm for a selective nearest neighbor decision rule (Corresp.)
• On the minimum consistent subset problem

This page was built for publication: Minimum consistent subset problem for trees