3 papers
cs.DS2025
Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size
Alessio Conte, Roberto Grossi, Yasuaki Kobayashi +4
Graphlets of order in a graph are connected subgraphs induced by nodes (called -graphlets) or by edges (called edge -graphlets). They are among the interestin…
cs.DS2024
Finding Diverse Strings and Longest Common Subsequences in a Graph
Yuto Shida, Giulia Punzi, Yasuaki Kobayashi +2
In this paper, we study for the first time the Diverse Longest Common Subsequences (LCSs) problem under Hamming distance. Given a set of a constant number of input strings, the pro…
cs.DS2024
Parameterized Complexity of Finding Dissimilar Shortest Paths
Ryo Funayama, Yasuaki Kobayashi, Takeaki Uno
We consider the problem of finding ``dissimilar'' shortest paths from to in an edge-weighted directed graph , where the dissimilarity is measured by the minimum pair…