EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

TDGNet: Two Different Graph Convolutional Networks for Approximate Subgraph Matching

Masaki Shirotani, Motoki Amagasaki, Masato Kiyama

IEEE Access · 2026 · 14 · 44962-44973

DOI: 10.1109/access.2026.3675983 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Access, 2026. Verfasst von Masaki Shirotani und 2 weiteren Autor:innen. Die Arbeit nennt 43 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: METI R&D Support Program for Growth-oriented Technology.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • METI R&D Support Program for Growth-oriented Technology

Zitieren

APA

Shirotani, M., Amagasaki, M., & Kiyama, M. (2026). TDGNet: Two Different Graph Convolutional Networks for Approximate Subgraph Matching. IEEE Access, 14, 44962-44973. https://doi.org/10.1109/access.2026.3675983

Vancouver

Shirotani M, Amagasaki M, Kiyama M. TDGNet: Two Different Graph Convolutional Networks for Approximate Subgraph Matching. IEEE Access. 2026;14:44962-44973. doi:10.1109/access.2026.3675983

BibTeX
@article{Shirotani2026,
  author = {Shirotani, Masaki and Amagasaki, Motoki and Kiyama, Masato},
  title = {TDGNet: Two Different Graph Convolutional Networks for Approximate Subgraph Matching},
  journal = {IEEE Access},
  year = {2026},
  volume = {14},
  pages = {44962--44973},
  doi = {10.1109/access.2026.3675983}
}
Kostenlos starten →