scientific article

DOI<116::AID-RSA1001>3.0.CO;2-2 10.1002/1098-2418(200103)18:2<116::AID-RSA1001>3.0.CO;2-2zbMath0972.68129MaRDI QIDQ2712576

Anne Condon, Richard M. Karp

Publication date: 6 November 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

graph bisection problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

Repetition-free longest common subsequence of random sequences ⋮ Are Stable Instances Easy? ⋮ Mixture models with entropy regularization for community detection in networks ⋮ Convexified modularity maximization for degree-corrected stochastic block models ⋮ Connected-closeness: A Visual Quantification of Distances in Network Layouts ⋮ Community detection in networks via a spectral heuristic based on the clustering coefficient ⋮ A reductive approach to hypergraph clustering: an application to image segmentation ⋮ Combinatorial statistics and the sciences ⋮ Recovery guarantees for exemplar-based clustering ⋮ On the limiting spectral distributions of stochastic block models ⋮ Graph clustering with Boltzmann machines ⋮ A Simple SVD Algorithm for Finding Hidden Partitions ⋮ Limiting spectral distribution of stochastic block model ⋮ Clustering heterogeneous financial networks ⋮ Asymptotic mutual information for the balanced binary stochastic block model ⋮ Classification and estimation in the stochastic blockmodel based on the empirical degrees ⋮ Hidden Hamiltonian Cycle Recovery via Linear Programming ⋮ Graph clustering ⋮ A general view on computing communities ⋮ A Spectral Method for MAX2SAT in the Planted Solution Model ⋮ Community detection based on first passage probabilities ⋮ Disentangling group and link persistence in dynamic stochastic block models ⋮ Reconstruction and estimation in the planted partition model ⋮ Computing exact \(p\)-values for community detection ⋮ Contiguity and non-reconstruction results for planted partition models: the dense case ⋮ A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs ⋮ Submatrix localization via message passing ⋮ Stochastic block models are a discrete surface tension ⋮ Topological aspects of the multi-language phases of the naming game on community-based networks ⋮ Recovering the structure of random linear graphs ⋮ Unnamed Item ⋮ Dynamics on modular networks with heterogeneous correlations ⋮ Towards quantum computing based community detection ⋮ Matrix estimation by universal singular value thresholding ⋮ Distributed community detection in dynamic graphs ⋮ Distributed Community Detection in Dynamic Graphs ⋮ Relating Modularity Maximization and Stochastic Block Models in Multilayer Networks

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Some simplified NP-complete graph problems
• The Metropolis algorithm for graph bisection
• The solution of some random NP-hard problems in polynomial expected time
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• An Efficient Heuristic Procedure for Partitioning Graphs
• Genetic algorithm and graph partitioning