Detecting Non-subgraphs Efficiently by Comparing Eigenvalues of Decomposed Graphs

The problem of deciding whether a graph contains another graph appears in various applications. For solving this problem efficiently, we developed a numerical method to detect non-subgraphs, graphs which are not subgraphs of other graphs, by comparing eigenvalues of graphs. In this paper, we propose...

Ausführliche Beschreibung