Kumamoto University

output

19972026

most citedExplanation of Machine Learning Models Using Shapley Additive Explanation and Application for Real Data in Hospital

1.1k citations

Showing 2016 · math.COShow all

2 papers · 2 filters

math.CO2016

On directed 2-factors in digraphs and 2-factors containing perfect matchings in bipartite graphs

Shuya Chiba, Tomoki Yamashita

In this paper, we give the following result: If $D$ is a digraph of order $n$ , and if $d_{D}^{+} (u) + d_{D}^{-} (v) \geq n$ for every two distinct vertices $u$ and $v$ with $(u, v) \…

math.CO2016

Upper bounds on the size of transitive subtournaments in digraphs

Koji Momihara, Sho Suda

In this paper, we consider upper bounds on the size of transitive subtournaments in a digraph. In particular, we give an analogy of Hoffman's bound for the size of cocliques in a r…