A stochastic heuristic visualising graph clusters in a bi-dimensional space prior to partitioning
From MaRDI portal
Publication:1854904
DOI10.1023/A:1009665701840zbMath1064.90575OpenAlexW1535355448MaRDI QIDQ1854904
Paul Layzell, Pascale Kuntz, Dominique Snyers
Publication date: 1999
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1009665701840
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
A hierarchical ant based clustering algorithm and its use in three real-world applications ⋮ Foraging theory for dimensionality reduction of clustered data ⋮ An ant colony system for permutation flow-shop sequencing ⋮ Graph multidimensional scaling with self-organizing maps
This page was built for publication: A stochastic heuristic visualising graph clusters in a bi-dimensional space prior to partitioning
