scientific article; zbMATH DE number 637304

MaRDI QIDQ4304355zbMATH OpenFDO

Authors Farhad Shahrokhi, László A. Székely

Publication date 14 August 2000

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(20)

• Problems and results on judicious partitions
• On judicious bisections of graphs
• A bound for judicious \(k\)-partitions of graphs
• On judicious partitions of graphs
• Simple probabilistic analysis to generalize bottleneck graph multi-partitioning
• Partitioning 3-uniform hypergraphs
• Judicious bisection of hypergraphs
• Two remarks on ``Expanding and forwarding by P. Solé
• Balanced judicious bipartitions of graphs
• Bounds for judicious balanced bipartitions of graphs
• A note on balanced bipartitions
• On judicious partitions of hypergraphs with edges of size at most 3
• Bounds for pairs in partitions of graphs
• Graph partitioning: an updated survey
• Judicious \(k\)-partitions of graphs
• On several partitioning problems of Bollobás and Scott
• Bisection width of transposition graphs
• On a bipartition problem of Bollobás and Scott
• The Bollobás-Scott conjecture for 4-uniform hypergraphs
• On a problem of judicious \(k\)-partitions of graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4304355)