Kunihiro Wasa

collaborators

2 papers

cs.DS2025

Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size

Alessio Conte, Roberto Grossi, Yasuaki Kobayashi +4

Graphlets of order $k$ in a graph $G$ are connected subgraphs induced by $k$ nodes (called $k$ -graphlets) or by $k$ edges (called edge $k$ -graphlets). They are among the interestin…

cs.DS2024

Efficient Constant-Factor Approximate Enumeration of Minimal Subsets for Monotone Properties with Weight Constraints

Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa

A property $I^$ on a finite set $U$ is \emph{monotone} if for every $X \subseteq U$ satisfying $I^$ , every superset $Y \subseteq U$ of $X$ also satisfies $I^$ . Many combinatorial p…