A combinatorial design approach to MAXCUT

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1098-2418(199608/09)9:1/2<163::AID-RSA10>3.0.CO;2-P" /><163::AID-RSA10>3.0.CO;2-P 10.1002/(SICI)1098-2418(199608/09)9:1/2<163::AID-RSA10>3.0.CO;2-PzbMath0863.05037OpenAlexW1969189142MaRDI QIDQ4894607

Thomas Hofmeister, Hanno Lefmann

Publication date: 20 May 1997

Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(199608/09)9:1/2<163::aid-rsa10>3.0.co;2-p

zbMATH Keywords

partitionlinear time algorithmblock designs\(k\)-MAXCUT problem

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

A construction method for optimally universal hash families and its consequences for the existence of RBIBDs ⋮ Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties

This page was built for publication: A combinatorial design approach to MAXCUT