Graph clustering
DOI10.1016/j.cosrev.2007.05.001zbMath1302.68237OpenAlexW143174683MaRDI QIDQ458448
Publication date: 7 October 2014
Published in: Computer Science Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cosrev.2007.05.001
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (only showing first 100 items - show all)
Uses Software
Cites Work
- Algorithm AS 136: A K-Means Clustering Algorithm
- A clustering approach to the planar hub location problem
- Clustering large graphs via the singular value decomposition
- Correlation clustering
- Heuristics for the p-hub location problem
- Sparsest cuts and bottlenecks in graphs
- Spectral partitioning works: planar graphs and finite element meshes
- Random walks and local cuts in graphs
- Old and new results on algebraic connectivity of graphs
- Spectral bounds for the betweenness of a graph
- Spectral clustering and its use in bioinformatics
- On weakly cospectral graphs
- Experiments in projection and clustering by simulated annealing
- Fast online graph clustering via Erdős-Rényi mixture
- Clustering to minimize the maximum intercluster distance
- A heuristic for the p-center problem in graphs
- NP-hard problems in hierarchical-tree clustering
- Easy and hard bottleneck location problems
- Some simplified NP-complete graph problems
- Classifying molecular sequences using a linkage graph with their pairwise similarities
- Min-cut clustering
- Which graphs are determined by their spectrum?
- Exact and approximation algorithms for clustering
- A clustering algorithm based on graph connectivity
- Complexity of finding dense subgraphs
- Accuracy of computed eigenvectors via optimizing a Rayleigh quotient
- Web document clustering using hyperlink structures
- How the science of complex networks can help developing strategies against terrorism
- Cluster graph modification problems
- Clustering to minimize the sum of cluster diameters
- A proof of the triangle inequality for the Tanimoto distance
- Exploring networks with traceroute-like probes: Theory and simulations
- Finding optimal solutions to the graph partitioning problem with heuristic search
- A hierarchical clustering algorithm based on fuzzy graph connectedness
- Towards a unified territorial design approach - applications, algorithms and GIS integration. (With comments and rejoinder)
- A faster algorithm for betweenness centrality*
- A Polylogarithmic Approximation of the Minimum Bisection
- Sales Territory Alignment: A Review and Model
- Emergence of Scaling in Random Networks
- Detecting network communities: a new systematic and efficient algorithm
- Maximal Flow Through a Network
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Fuzzy clustering for the estimation of the parameters of the components of mixtures of normal distributions
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- A NEW CLUSTERING MODEL OF WIRELESS SENSOR NETWORKS USING FACILITY LOCATION THEORY
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- On clusterings
- Clustering Using Objective Functions and Stochastic Search
- A new approach to the maximum-flow problem
- Multi-Terminal Network Flows
- A Comparison of the Stability Characteristics of Some Graph Theoretic Clustering Methods
- An Efficient Heuristic Procedure for Partitioning Graphs
- Algorithms on Strings, Trees and Sequences
- How Many Clusters? Which Clustering Method? Answers Via Model-Based Cluster Analysis
- How to Allocate Network Centers
- Algebraic Graph Theory
- Hub Location and the p-Hub Median Problem
- On the Quality of Spectral Separators
- The Structure and Function of Complex Networks
- Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
- The Capacitated K-Center Problem
- Community structure in social and biological networks
- Graph Clustering and Minimum Cut Trees
- The Spectra of Random Graphs with Given Expected Degrees
- A Fast Parametric Maximum Flow Algorithm and Applications
- 10.1162/1532443041827943
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Signless Laplacians and line graphs
- The worldwide air transportation network: Anomalous centrality, community structure, and cities' global roles
- Machine Learning: ECML 2004
- Random Graphs
- Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
- Experimental and Efficient Algorithms
- Integer Programming and Combinatorial Optimization
- SOFSEM 2006: Theory and Practice of Computer Science
- Expander flows, geometric embeddings and graph partitioning
- A decentralized algorithm for spectral analysis
- The dense \(k\)-subgraph problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Graph clustering