EUVIMEDEUVIMED entdecken
Crossref

Bipartite domination in graphs: complexity and algorithms

Bhawani Sankar Panda, Subhasmita Joshi, Dalu Jacob

Theoretical Computer Science · 2026-08 · 1081 · 116076

DOI: 10.1016/j.tcs.2026.116076 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Theoretical Computer Science, 2026-08. Verfasst von Bhawani Sankar Panda und 2 weiteren Autor:innen. Die Arbeit nennt 18 Literaturangaben. Gefördert von: Indian Institute of Technology Delhi.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • Indian Institute of Technology Delhi

Zitieren

APA

Panda, B. S., Joshi, S., & Jacob, D. (2026). Bipartite domination in graphs: complexity and algorithms. Theoretical Computer Science, 1081, 116076. https://doi.org/10.1016/j.tcs.2026.116076

Vancouver

Panda BS, Joshi S, Jacob D. Bipartite domination in graphs: complexity and algorithms. Theoretical Computer Science. 2026;1081:116076. doi:10.1016/j.tcs.2026.116076

BibTeX
@article{Panda2026,
  author = {Panda, Bhawani Sankar and Joshi, Subhasmita and Jacob, Dalu},
  title = {Bipartite domination in graphs: complexity and algorithms},
  journal = {Theoretical Computer Science},
  year = {2026},
  volume = {1081},
  pages = {116076},
  doi = {10.1016/j.tcs.2026.116076}
}
Kostenlos starten →