EUVIMEDEUVIMED entdecken
Crossref

Finding and counting patterns in sparse graphs

Balagopal Komarath, Anant Kumar, Suchismita Mishra, Aditi Sethia

Journal of Computer and System Sciences · 2026-05 · 157 · 103728

DOI: 10.1016/j.jcss.2025.103728 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Computer and System Sciences, 2026-05. Verfasst von Balagopal Komarath und 3 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 24 Literaturangaben. Gefördert von: Indian Institute of Technology Gandhinagar, Fondo Nacional de Desarrollo Científico y Tecnológico, ANID.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • Indian Institute of Technology Gandhinagar
  • Fondo Nacional de Desarrollo Científico y Tecnológico
  • ANID

Zitieren

APA

Komarath, B., Kumar, A., Mishra, S., & Sethia, A. (2026). Finding and counting patterns in sparse graphs. Journal of Computer and System Sciences, 157, 103728. https://doi.org/10.1016/j.jcss.2025.103728

Vancouver

Komarath B, Kumar A, Mishra S, Sethia A. Finding and counting patterns in sparse graphs. Journal of Computer and System Sciences. 2026;157:103728. doi:10.1016/j.jcss.2025.103728

BibTeX
@article{Komarath2026,
  author = {Komarath, Balagopal and Kumar, Anant and Mishra, Suchismita and Sethia, Aditi},
  title = {Finding and counting patterns in sparse graphs},
  journal = {Journal of Computer and System Sciences},
  year = {2026},
  volume = {157},
  pages = {103728},
  doi = {10.1016/j.jcss.2025.103728}
}
Kostenlos starten →