A fast minimum spanning tree algorithm based on \(K\)-means (Q527132)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	A fast minimum spanning tree algorithm based on \(K\)-means	scientific article

Statements

scholarly article

A fast minimum spanning tree algorithm based on \(K\)-means (English)

Information Sciences

publication date

16 May 2017

zbMATH Keywords

minimum spanning tree

clustering

manifold learning

\(K\)-means

MaRDI profile type

MaRDI publication profile

full work available at URL

https://doi.org/10.1016/j.ins.2014.10.012

Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs

Robust path-based spectral clustering

A minimum spanning tree algorithm with inverse-Ackermann type complexity

The multi-criteria minimum spanning tree problem based genetic algorithm

Finding Minimum Spanning Trees

Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation

A note on two problems in connexion with graphs

Centroidal Voronoi Tessellations: Applications and Algorithms

Sur la liaison et la division des points d'un ensemble fini

Fibonacci heaps and their uses in improved network optimization algorithms

Efficient algorithms for finding minimum spanning trees in undirected and directed graphs

A Distributed Algorithm for Minimum-Weight Spanning Trees

A fast distributed approximation algorithm for minimum spanning trees

On the shortest spanning subtree of a graph and the traveling salesman problem

Ectropy of diversity measures for populations in Euclidean space

A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction

A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest

A new cluster validity index for the fuzzy c-mean

Minimum Spanning Trees in <i>k</i>-Dimensional Space

An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees

Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters

A graph-theoretical clustering method based on two rounds of minimum spanning trees

Resonance, stability and chaotic vibration of a quarter-car vehicle model with time-delay feedback

Identifiers

zbMATH Open document ID

10.1016/j.ins.2014.10.012

Mathematics Subject Classification ID

zbMATH DE Number

Sitelinks

Mathematics(1 entry)

mardi Publication:527132

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q527132&oldid=36321485"