conference

Finding Order-Preserving Subgraphs.

Haruya Imamura, Yasuaki Kobayashi, Yota Otachi, Toshiki Saitoh, Keita Sato, Asahi Takaoka, Ryo Yoshinaka, Tom C. van der Zanden

WALCOM: Algorithms and Computation - 20th International Conference and Workshops on Algorithms and Computation, WALCOM 2026, Perugia, Italy, March 4-6, 2026, Proceedings, , pp.157-171 (2026), [peer-reviewed]
Event Date: March 4-6, 2026

DOI External Link

Abstract / 概要

(Induced) Subgraph Isomorphism and Maximum Common (Induced) Subgraph are fundamental problems in graph pattern matching and similarity computation. In graphs derived from time-series data or protein structures, a natural total ordering of vertices often arises from…

DOI: 10.1007/978-981-95-7127-7_11