2 papers
cs.DS2025
Finding Order-Preserving Subgraphs
Haruya Imamura, Yasuaki Kobayashi, Yota Otachi +5
(Induced) Subgraph Isomorphism and Maximum Common (Induced) Subgraph are fundamental problems in graph pattern matching and similarity computation. In graphs derived from time-seri…
cs.DS2025
A polynomial delay algorithm generating all potential maximal cliques in triconnected planar graphs
Alexander Grigoriev, Yasuaki Kobayashi, Hisao Tamaki +1
We develop a new characterization of potential maximal cliques of a triconnected planar graph and, using this characterization, give a polynomial delay algorithm generating all pot…