In this paper, we present the first study of the computational complexit...
In a vertex-colored graph G = (V, E), a subset S ⊆ V is said to
be consi...
Since the seminal paper by Breiman in 2001, who pointed out a potential ...
Park et al. [TCS 2020] observed that the similarity between two (numeric...
Post-hoc explanation methods for machine learning models have been widel...
Learning of interpretable classification models has been attracting much...
In this study, we address the independent set enumeration problem. Altho...
In this paper, we address the independent set enumeration problem. Altho...
In conventional prediction tasks, a machine learning algorithm outputs a...
In this paper, we propose a characterization of chordal bipartite graphs...
The girth of a graph is the length of its shortest cycle. Due to its
rel...
Dominating sets are fundamental graph structures. However, enumeration o...
The edge partition model (EPM) is a fundamental Bayesian nonparametric m...