Search Results for author:
Found 1 papers, 0 papers with code
Weighted Laplacian and Its Theoretical Applications
In this paper, we develop a novel weighted Laplacian method, which is partially inspired by the theory of graph Laplacian, to study recent popular graph problems, such as multilevel graph partitioning and balanced minimum cut problem, in a more convenient manner.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
