Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
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 QIDQ831758FDOQ831758


Authors: Sanjana Dey, Anil Maheshwari, Subhas C. Nandy Edit this on Wikidata


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)


Cites Work

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


Cited In (1)

  • Minimum consistent subset problem for trees





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

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

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