Skip to main navigation Skip to search Skip to main content

Algorithms for the minimum dominating set problem in bounded arboricity graphs: Simpler, faster, and combinatorial

  • Tel Aviv University
  • Massachusetts Institute of Technology

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Scopus citations

Fingerprint

Dive into the research topics of 'Algorithms for the minimum dominating set problem in bounded arboricity graphs: Simpler, faster, and combinatorial'. Together they form a unique fingerprint.
Sort by

Mathematics

Computer Science

Keyphrases