Graph Clustering and Minimum Cut Trees
From MaRDI portal
Recommendations
Cited in
(45)- Approximation algorithms for a hierarchically structured bin packing problem
- The clustering matroid and the optimal clustering tree
- Layered clusters of tightness set functions
- Linking temporal records
- Distance preserving model order reduction of graph-Laplacians and cluster analysis
- A note on the satisfactory partition problem: constant size requirement
- Graph clustering via generalized colorings
- Centroid based tree-structured data clustering using vertex/edge overlap and graph edit distance
- Topological graph clustering with thin position
- Symmetric submodular system: contractions and Gomory-Hu tree
- A graph-theoretical clustering method based on two rounds of minimum spanning trees
- Online summarization of dynamic graphs using subjective interestingness for sequential data
- Clustering with prim's sequential representation of minimum spanning tree
- Contracted webgraphs: structure mining and scale-freeness
- scientific article; zbMATH DE number 5904848 (Why is no real title available?)
- Pairwise data clustering and applications
- Engineering graph clustering: models and experimental evaluation
- scientific article; zbMATH DE number 3970751 (Why is no real title available?)
- scientific article; zbMATH DE number 2043371 (Why is no real title available?)
- Graph clustering
- A general view on computing communities
- EFFICIENT APPROXIMATION ALGORITHMS FOR PAIRWISE DATA CLUSTERING AND APPLICATIONS
- Finding large k-clubs in undirected graphs
- Constrained overlapping clusters: minimizing the negative effects of bridge‐nodes
- A framework for clustering massive graph streams
- A general framework for efficient clustering of large datasets based on activity detection
- Memetic graph clustering
- Graph clustering by hierarchical singular value decomposition with selectable range for number of clusters members
- Fully-dynamic hierarchical graph clustering using cut trees
- Modelling human network behaviour using simulation and optimization tools: the need for hybridization
- Graph clustering in industrial networks
- Complete hierarchical cut-clustering: a case study on expansion and modularity
- Energy Models for Graph Clustering
- Dynamic graph clustering using minimum-cut trees
- Dynamic Graph Clustering Using Minimum-Cut Trees
- Graph Drawing
- Quasi-optimal \textit{hp}-finite element refinements towards singularities via deep neural network prediction
- A novel graph-theoretical clustering approach to find a reduced set with extreme solutions of Pareto optimal solutions for multi-objective optimization problems
- Distributional limits of graph cuts on discretized grids
- Automatically finding clusters in normalized cuts
- Nash stability in additively separable hedonic games and community structures
- On the complexity of isoperimetric problems on trees
- Information cut for clustering using a gradient descent approach
- Clustering and outlier detection using isoperimetric number of trees
- Min-max communities in graphs: complexity and computational properties
This page was built for publication: Graph Clustering and Minimum Cut Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4672747)
