Minimum selective subset on unit disk graphs and circle graphs

DOI10.1007/978-3-032-17156-6_23MaRDI QIDQ7307332zbMATH OpenFDO

Authors Bubai Manna

Publication date 31 July 2026

Full work available at URL https://doi.org/10.1007/978-3-032-17156-6_23

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Algorithms in computer science (68Wxx)

Cites work

• A Faster Algorithm for Maximum Induced Matchings on Circle Graphs
• Algorithms and hardness results for nearest neighbor problems in bicolored point sets
• APX-hardness of domination problems in circle graphs
• Consistent subset problem with two labels
• Graph-Theoretic Concepts in Computer Science
• scientific article; zbMATH DE number 1559563 (Why is no real title available?)
• Minimum consistent subset of simple graph classes
• Minimum consistent subset problem for trees
• On the minimum consistent subset problem
• Parameterized algorithms
• Refined lower bounds for nearest neighbor condensation
• The minimum consistent spanning subset problem on trees
• Unit disk graphs

This page was built for publication: Minimum selective subset on unit disk graphs and circle graphs

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