Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Minimum consistent subset of simple graph classes

From MaRDI portal
Publication:831758
Jump to:navigation, search

DOI10.1007/978-3-030-67899-9_37OpenAlexW3128316836MaRDI QIDQ831758

Subhas C. Nandy, Sanjana Dey, Anil Maheshwari

Publication date: 24 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-67899-9_37



Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)


Related Items (1)

Minimum consistent subset problem for trees




Cites Work

  • Algorithms and hardness results for nearest neighbor problems in bicolored point sets
  • Consistent subset problem with two labels
  • On the minimum consistent subset problem




This page was built for publication: Minimum consistent subset of simple graph classes

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:831758&oldid=12770910"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 30 January 2024, at 13:50.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki