scientific article; zbMATH DE number 1787231

zbMath1014.90082MaRDI QIDQ4550236

Béla Bollobás, Alexander D. Scott

Publication date: 17 July 2003

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

zbMATH Keywords

approximation algorithm

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (49)

On judicious partitions of uniform hypergraphs ⋮ On judicious partitions of graphs ⋮ The Crossing Number of the Cone of a Graph ⋮ Biased partitions and judicious \(k\)-partitions of graphs ⋮ On judicious bipartitions of directed graphs ⋮ Satisfying more than half of a system of linear equations over GF(2): a multivariate approach ⋮ Three conjectures in extremal spectral graph theory ⋮ On several partitioning problems of Bollobás and Scott ⋮ Note on maximal bisection above tight lower bound ⋮ On a Conjecture of Erdős, Gallai, and Tuza ⋮ Bounds for pairs in judicious partitioning of graphs ⋮ On judicious bisections of graphs ⋮ Inverting the Turán problem ⋮ Making an H $H$‐free graph k $k$‐colorable ⋮ Upper bounds on minimum balanced bipartitions ⋮ Lower Bounds for Maximum Weighted Cut ⋮ Graph partitioning: an updated survey ⋮ Maximum cuts and judicious partitions in graphs without short cycles ⋮ The Crossing Number of the Cone of a Graph ⋮ Bisections of Graphs Without Short Cycles ⋮ The Bollobás--Scott Conjecture for 4-Uniform Hypergraphs ⋮ Maximum cuts of graphs with forbidden cycles ⋮ Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound ⋮ A bound for judicious \(k\)-partitions of graphs ⋮ The Bollobás-Thomason conjecture for \(3\)-uniform hypergraphs ⋮ Maximum bisections of graphs without short even cycles ⋮ Judicious partitions of uniform hypergraphs ⋮ \textsc{Max-Cut} parameterized above the Edwards-Erdős bound ⋮ An improved kernel for max-bisection above tight lower bound ⋮ Making a \(K_4\)-free graph bipartite ⋮ Dense induced bipartite subgraphs in triangle-free graphs ⋮ A note on balanced bipartitions ⋮ Max \(k\)-cut and judicious \(k\)-partitions ⋮ On judicious bipartitions of graphs ⋮ Linear kernels and linear-time algorithms for finding large cuts ⋮ Judicious \(k\)-partitions of graphs ⋮ Approximating long cycle above Dirac's guarantee ⋮ Maximum bisections of graphs with girth at least six ⋮ Maximum bisections of graphs without cycles of length four and five ⋮ MAXIMUM CUTS IN GRAPHS WITHOUT WHEELS ⋮ BIPARTITE SUBGRAPHS OF -FREE GRAPHS ⋮ On a Problem of Judiciousk-Partitions of Graphs ⋮ Judicious partitions of bounded‐degree graphs ⋮ Maximum bipartite subgraphs in graphs without short cycles ⋮ Hypergraph cuts above the average ⋮ Lower Bounds for Max-Cut in $H$-Free Graphs via Semidefinite Programming ⋮ On problems about judicious bipartitions of graphs ⋮ Maximum bipartite subgraphs in $H$-free graphs ⋮ On bisections of directed graphs

This page was built for publication: