Abstract: A growing number of knowledge graphs are being released by diverse sources. The massive volume of linked data aims to provide entities with semantic context. The entities can be validated in ...
Abstract: We study augmenting a connected graph with a limited number of edges to maximize its spanning-tree connectivity, quantified by the log-determinant of the reduced Laplacian. The problem is NP ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results