Graph Partitioning and Graph Clustering
Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Trees (05C05) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
- Convex optimization for the densest subgraph and densest submatrix problems
- An exact algorithm for min-max hyperstructure equipartition with a connected constraint
- An expressive dissimilarity measure for relational clustering using neighbourhood trees
- Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization
- Improved compact formulations for a wide class of graph partitioning problems in sparse graphs
- Uniform and most uniform partitions of trees
- Computing maximum \(k\)-defective cliques in massive graphs
- Political districting to minimize cut edges
- An effective branch-and-bound algorithm for the maximum s-bundle problem
- Graph signatures: identification and optimization
- A biased random-key genetic algorithm for data clustering
- Metaheuristics for the minimum gap graph partitioning problem
- Advanced coarsening schemes for graph partitioning
- A minimal surface criterion for graph partitioning
- Efficient implementation of a synchronous parallel push-relabel algorithm
- Fast quasi-threshold editing
- Graph bisection with Pareto optimization
- Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches
- Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs
- Trust your data or not -- StQP remains StQP: community detection via robust standard quadratic optimization
- Distance-Preserving Graph Contractions
- Scalable semidefinite programming
- On Fault-Tolerant Low-Diameter Clusters in Graphs
- Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm
- Partitioning large-scale artificial society on distributed cluster with statistical movement graph
- Partitioning a graph into minimum gap components
- $k$-partitioned fuzzy graph
- Distance-Preserving Graph Contractions
- A branch-price-and-cut algorithm for packing cuts in undirected graphs
- Metropolized Forest Recombination for Monte Carlo Sampling of Graph Partitions
- Iterated multilevel simulated annealing for large-scale graph conductance minimization
- Asymptotic bounds for clustering problems in random graphs
- Incremental measurement of structural entropy for dynamic graphs
- Crick's ``Frozen accident theory of the genetic code explored by Ising models
- There and back again: on applying data reduction rules by undoing others
- Edge expansion of a graph: SDP-based computational strategies
- Linear-time multilevel graph partitioning via edge sparsification
- An exact combinatorial algorithm for minimum graph bisection
This page was built for publication: Graph Partitioning and Graph Clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4917013)
