We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...
Fedor V. Fomin, Serge Gaspers, Saket Saurabh, St&e...
Several validity indices have been designed to evaluate solutions obtained by clustering algorithms. Traditional indices are generally designed to evaluate center-based clustering...
Noha A. Yousri, Mohamed S. Kamel, Mohamed A. Ismai...
Clusters of PC containing mostly general purpose hardware have become more and more usable for high performance computing tasks in the past few years. Clustering existing systems ...
— In the standard approach to studying connectivity, a physical layer is assumed that allows direct transmission between neighbors within some fixed distance. The graph resultin...
Abstract. Let G denote a directed graph with adjacency matrix Q and indegree matrix D. We consider the Kirchhoff matrix L = D - Q, sometimes referred to as the directed Laplacian. ...