EUVIMEDEUVIMED entdecken
Crossref

On the complexity of minimum membership dominating set

D. Karthika, R. Muthucumaraswamy, Matthias Bentert, Sriram Bhyravarapu, Saket Saurabh, Sanjay Seetharaman

Theoretical Computer Science · 2026-09 · 1083 · 116121

DOI: 10.1016/j.tcs.2026.116121 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Theoretical Computer Science, 2026-09. Verfasst von D. Karthika und 5 weiteren Autor:innen. Die Arbeit nennt 26 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Zitieren

APA

Karthika, D., Muthucumaraswamy, R., Bentert, M., Bhyravarapu, S., Saurabh, S., & Seetharaman, S. (2026). On the complexity of minimum membership dominating set. Theoretical Computer Science, 1083, 116121. https://doi.org/10.1016/j.tcs.2026.116121

Vancouver

Karthika D, Muthucumaraswamy R, Bentert M, Bhyravarapu S, Saurabh S, Seetharaman S. On the complexity of minimum membership dominating set. Theoretical Computer Science. 2026;1083:116121. doi:10.1016/j.tcs.2026.116121

BibTeX
@article{Karthika2026,
  author = {Karthika, D. and Muthucumaraswamy, R. and Bentert, Matthias and Bhyravarapu, Sriram and Saurabh, Saket and Seetharaman, Sanjay},
  title = {On the complexity of minimum membership dominating set},
  journal = {Theoretical Computer Science},
  year = {2026},
  volume = {1083},
  pages = {116121},
  doi = {10.1016/j.tcs.2026.116121}
}
Kostenlos starten →