DOI10.1090/conm/588zbMath1262.05001OpenAlexW1556784394WikidataQ56688748 ScholiaQ56688748MaRDI QIDQ4917013
No author found.
Publication date: 26 April 2013
Published in: Contemporary Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/conm/588
Efficient Implementation of a Synchronous Parallel Push-Relabel Algorithm,
Fast Quasi-Threshold Editing,
On Fault-Tolerant Low-Diameter Clusters in Graphs,
A minimal surface criterion for graph partitioning,
An exact algorithm for min-max hyperstructure equipartition with a connected constraint,
Graph Bisection with Pareto Optimization,
Metaheuristics for the minimum gap graph partitioning problem,
Iterated multilevel simulated annealing for large-scale graph conductance minimization,
Partitioning large-scale artificial society on distributed cluster with statistical movement graph,
An expressive dissimilarity measure for relational clustering using neighbourhood trees,
Asymptotic bounds for clustering problems in random graphs,
A biased random-key genetic algorithm for data clustering,
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,
Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization,
An effective branch-and-bound algorithm for the maximum \(s\)-bundle problem,
Graph signatures: identification and optimization,
Partitioning a graph into minimum gap components,
Improved compact formulations for a wide class of graph partitioning problems in sparse graphs,
Metropolized Forest Recombination for Monte Carlo Sampling of Graph Partitions,
Uniform and most uniform partitions of trees,
Computing maximum \(k\)-defective cliques in massive graphs,
Convex optimization for the densest subgraph and densest submatrix problems,
Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm,
An exact combinatorial algorithm for minimum graph bisection,
Advanced Coarsening Schemes for Graph Partitioning,
Distance-Preserving Graph Contractions,
Trust Your Data or Not—StQP Remains StQP: Community Detection via Robust Standard Quadratic Optimization,
Unnamed Item,
Scalable Semidefinite Programming,
Distance-Preserving Graph Contractions,
Political districting to minimize cut edges,
A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs
