Abstract: The best-first search algorithm A* allows search graphs that are trees, directed acyclic graphs or directed graphs with cycles. In real life applications of A* the search graph is generally ...

In this work, we propose a spectral-based graph convolutional network for directed graphs. The proposed model employs the classic singular value decomposition (SVD) to perform signal decomposition ...