Graph Counterfactual Explanations Made Minimal: NP-Hard Problem Tamed by Local Bounded Search
Researchers have proven that minimizing graph counterfactual explanations is NP-hard and introduced Local Bounded Search, an algorithm that shrinks graph-based ...
