Max Cut for Random Graphs with a Planted Partition

Max Cut for Random Graphs with a Planted Partition

Bibliographic Details
Main Authors:	Bollobás, B, Scott, A
Format:	Journal article
Published:	2004

Similar Items

Max k-cut and judicious k-partitions
by: Bollobas, B, et al.
Published: (2010)

Judicious partitions of graphs
by: Bollobás, B, et al.
Published: (1993)

On the max-cut of sparse random graphs
by: Gamarnik, David, et al.
Published: (2019)

The cut metric, random graphs, and branching processes
by: Bollobas, B, et al.
Published: (2009)

Packing random graphs and hypergraphs
by: Bollobas, B, et al.
Published: (2016)

Sparse random graphs with clustering
by: Bollobas, B, et al.
Published: (2008)

Sparse graphs: metrics and random models
by: Bollobas, B, et al.
Published: (2008)

Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
by: Scott, A, et al.
Published: (2006)

Intersections of Graphs
by: Bollobas, B, et al.
Published: (2011)

The phase transition in inhomogeneous random graphs
by: Bollobas, B, et al.
Published: (2005)

Dense subgraphs in random graphs
by: Balister, P, et al.
Published: (2019)

Sigma Partitioning: Complexity and Random Graphs
by: Ali Dehghan, et al.
Published: (2018-12-01)

Judicious partitions of bounded-degree graphs
by: Bollob�s, B, et al.
Published: (2004)

Separating systems and oriented graphs of diameter two
by: Bollobás, B, et al.
Published: (2007)

The threshold for jigsaw percolation on random graphs
by: Bollobás, B, et al.
Published: (2017)

An Improved Approximation Algorithm for Quantum Max-Cut on Triangle-Free Graphs
by: Robbie King
Published: (2023-11-01)

Partitions and orientations of the Rado graph
by: Diestel, R, et al.
Published: (2007)

Exact Bounds for Judicious Partitions of Graphs
by: Bolloband#x000E1;s, B, et al.
Published: (1999)

The phase transition in the uniformly grown random graph has infinite order
by: Bollobas, B, et al.
Published: (2005)

On approximate graph colouring and MAX−k−CUT algorithms based on the ϑ−function
by: de Klerk, E, et al.
Published: (2004)

On approximate graph colouring and max-k-cut algorithms based on the θ-function
by: Klerk, Etienne de., et al.
Published: (2013)

Graph partitionning /
by: Bichot, Charles-Edmond 532206, et al.
Published: (c201)

Paths of specified length in random k-partite graphs
by: C.R. Subramanian
Published: (2001-01-01)

Paths of specified length in random k-partite graphs
by: C. R. Subramanian
Published: (2001-12-01)

Monotone graph limits and quasimonotone graphs
by: Bollobas, B, et al.
Published: (2011)

Advances in graph theory /
by: Bollobas, Bela
Published: (1978)

Metrics for sparse graphs
by: Bollobas, B, et al.
Published: (2007)

Intersections of random hypergraphs and tournaments
by: Bollobas, B, et al.
Published: (2014)

Graph Partitions in Chemistry
by: Ioannis Michos, et al.
Published: (2023-10-01)

On the path partition of graphs
by: Mekkia Kouider, et al.
Published: (2023-07-01)

Maximum directed cuts in acyclic digraphs
by: Alon, N, et al.
Published: (2007)

Improved kernels for Signed Max Cut parameterized above lower bound on (r,l)-graphs
by: Luerbio Faria, et al.
Published: (2017-06-01)

Duality in inhomogeneous random graphs, and the cut metric
by: Janson, S, et al.
Published: (2009)

Modern graph theory /
by: 306182 Bollobas, Bela
Published: (1998)

Extremal graph theory /
by: 306182 Bollobas, Bela
Published: (1978)

Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs
by: Karger, David R., et al.
Published: (2015)

Min-max and max-min graph saturation parameters
by: S. Sudha, et al.
Published: (2020-09-01)

Central partition for a partition-distance and strong pattern graph
by: Joaquim F. Pinto da Costa, et al.
Published: (2004-11-01)

Graph theory : an introduction course /
by: 306182 Bollobas, Bela
Published: (1979)

Community-based RDF graph partitioning
by: Banda, F, et al.
Published: (2020)