An efficient linear-time algorithm, EiG-Search, that generates edge-induced subgraph explanations for Graph Neural Networks, outperforming existing methods in faithfulness and efficiency.
