scientific article; zbMATH DE number 637304
From MaRDI portal
Publication:4304355
zbMATH Open0942.68581MaRDI QIDQ4304355FDOQ4304355
Authors: Farhad Shahrokhi, László A. Székely 
Publication date: 14 August 2000
Title of this publication is not available (Why is that?)
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
- Balanced judicious bipartitions of graphs
- Judicious bisection of hypergraphs
- Two remarks on ``Expanding and forwarding by P. Solé
- Graph partitioning: an updated survey
- Bounds for judicious balanced bipartitions of graphs
- On judicious partitions of hypergraphs with edges of size at most 3
- A note on balanced bipartitions
- Bounds for pairs in partitions of graphs
- Judicious \(k\)-partitions of graphs
- On several partitioning problems of Bollobás and Scott
- Bisection width of transposition graphs
- The Bollobás-Scott conjecture for 4-uniform hypergraphs
- On a bipartition problem of Bollobás and Scott
- 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)
