Max Cut for Random Graphs with a Planted Partition

Bibliographic Details
Main Authors: Bollobás, B, Scott, A
Format: Journal article
Published: 2004
_version_ 1797063795979321344
author Bollobás, B
Scott, A
author_facet Bollobás, B
Scott, A
author_sort Bollobás, B
collection OXFORD
description
first_indexed 2024-03-06T21:05:02Z
format Journal article
id oxford-uuid:3c284b3b-ab12-4883-b277-42103fa06873
institution University of Oxford
last_indexed 2024-03-06T21:05:02Z
publishDate 2004
record_format dspace
spelling oxford-uuid:3c284b3b-ab12-4883-b277-42103fa068732022-03-26T14:11:52Z Max Cut for Random Graphs with a Planted PartitionJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:3c284b3b-ab12-4883-b277-42103fa06873Symplectic Elements at Oxford2004Bollobás, BScott, A
spellingShingle Bollobás, B
Scott, A
Max Cut for Random Graphs with a Planted Partition
title Max Cut for Random Graphs with a Planted Partition
title_full Max Cut for Random Graphs with a Planted Partition
title_fullStr Max Cut for Random Graphs with a Planted Partition
title_full_unstemmed Max Cut for Random Graphs with a Planted Partition
title_short Max Cut for Random Graphs with a Planted Partition
title_sort max cut for random graphs with a planted partition
work_keys_str_mv AT bollobasb maxcutforrandomgraphswithaplantedpartition
AT scotta maxcutforrandomgraphswithaplantedpartition