2 citations · 2 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Fast Enumeration of Minimal Removable Sets in Monotone Systems with Application to Core Collapse Analysis
Kan Shota, Kazuya Haraguchi
In network vulnerability analysis, it is crucial to evaluate the robustness of -cores against vertex removals. A -core is often fragile since removing a few vertices can trig…
cs.DS2024★ 2 cited
SSD Set System, Graph Decomposition and Hamiltonian Cycle
Kan Shota, Kazuya Haraguchi
In this paper, we first study what we call Superset-Subset-Disjoint (SSD) set system. Based on properties of SSD set system, we derive the following (I) to (IV): (I) For a nonnegat…