Minimum consistent subset problem for trees

DOI10.1007/978-3-030-86593-1_14MaRDI QIDQ2140499zbMATH OpenOpenAlexFDO

Authors Sanjana Dey, Anil Maheshwari, Subhas C. Nandy

Publication date 20 May 2022

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

zbMATH Keywords

consistent subsetgraphsoptimal algorithmtrees

Mathematics Subject Classification ID

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

Recommendations

• Minimum consistent subset of simple graph classes
• On the minimum consistent subset problem
• On the minimum consistent subset problem
• On the minimum label spanning tree problem

Cites work

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

Cited in

(10)

• scientific article; zbMATH DE number 3853142 (Why is no real title available?)
• A minimum-length covering subtree of a tree
• Minimum-Entropy Tree Structures with a Given Terminal Node Assignment
• scientific article; zbMATH DE number 1935512 (Why is no real title available?)
• On the minimum consistent subset problem
• On the minimum consistent subset problem
• Minimum consistent subset of simple graph classes
• The minimum consistent spanning subset problem on trees
• Minimum consistent subset in trees and interval graphs
• Minimum selective subset on unit disk graphs and circle graphs

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

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