Publication:4260388
From MaRDI portal
zbMath0925.05053MaRDI QIDQ4260388
No author found.
Publication date: 19 September 1999
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Graph Bisection with Pareto Optimization, Effective Resistance Preserving Directed Graph Symmetrization, Unnamed Item, A Performance Guarantee for Spectral Clustering, Data Analytics on Graphs Part III: Machine Learning on Graphs, from Graph Topology to Applications, Dynamical Systems Theory and Algorithms for NP-hard Problems, Memetic Graph Clustering, Modified Cheeger and ratio cut methods using the Ginzburg–Landau functional for classification of high-dimensional data, Hearing the clusters of a graph: A distributed algorithm, \(\alpha\)-vertex separator is NP-hard even for 3-regular graphs, SONET/SDH ring assignment with capacity constraints, Multiway \(p\)-spectral graph cuts on Grassmann manifolds, A review on spectral clustering and stochastic block models, Decision-based scenario clustering for decision-making under uncertainty, Partial differential equations and variational methods for geometric processing of images, Certifying global optimality of graph cuts via semidefinite relaxation: a performance guarantee for spectral clustering, Mean curvature, threshold dynamics, and phase field theory on finite graphs, Minimum spectral connectivity projection pursuit. Divisive clustering using optimal projections for spectral clustering, A survey of kernel and spectral methods for clustering, Comparisons of different methods for balanced data classification under the discrete non-local total variational framework, Diffuse Interface Models on Graphs for Classification of High Dimensional Data, Clustered Matrix Approximation, Approximating Spectral Clustering via Sampling: A Review, Improving Spectral Clustering Using the Asymptotic Value of the Normalized Cut
