Max Cut for Random Graphs With a Planted Partition

Combinatorics Probability and Computing - United Kingdom
doi 10.1017/s0963548304006303
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Cambridge University Press (CUP)

Related search

Partitioning Planar Graphs: A Fast Combinatorial Approach for Max-Cut

Computational Optimization and Applications
ControlComputational MathematicsApplied MathematicsOptimization
2010English

Reduced Graphs for Min-Cut/Max-Flow Approaches in Image Segmentation

Electronic Notes in Discrete Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2011English

A Branch-And-Cut Algorithm for Partition Coloring

Networks
Information SystemsComputer NetworksHardwareCommunicationsArchitectureSoftware
2009English

Ontario: Two Trees Planted for Each One Cut?

Forestry Chronicle
Forestry
1981English

Approximate Max K-Cut With Subgraph Guarantee

Information Processing Letters
Signal ProcessingComputer Science ApplicationsInformation SystemsTheoretical Computer Science
1998English

P2: A Random Effects Model With Covariates for Directed Graphs

Statistica Neerlandica
UncertaintyStatisticsProbability
2004English

Sandwiching Random Regular Graphs Between Binomial Random Graphs

2020English

Advanced Scatter Search for the Max-Cut Problem

INFORMS Journal on Computing
Management ScienceComputer Science ApplicationsInformation SystemsOperations ResearchSoftware
2009English

Optimization and Optimality Test for the Max-Cut Problem

Mathematical Methods of Operations Research
Management ScienceSoftwareOperations ResearchMathematics
1990English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy