Bisecting sparse random graphs
Luczak, M. J. & McDiarmid, C.
(2001).
Bisecting sparse random graphs.
Random Structures and Algorithms,
18(1), 31-38.
https://doi.org/10.1002/1098-2418(200101)18:1<31::AID-RSA3>3.0.CO;2-1
| Item Type | Article |
|---|---|
| Copyright holders | © 2001 John Wiley & Sons |
| Departments | LSE > Academic Departments > Mathematics |
| DOI | 10.1002/1098-2418(200101)18:1<31::AID-RSA3>3.0.CO;2-1 |
| Date Deposited | 11 Nov 2008 |
| URI | https://researchonline.lse.ac.uk/id/eprint/17554 |
Explore Further
- https://www.scopus.com/pages/publications/0035529271 (Scopus publication)
- http://www3.interscience.wiley.com/journal/38107/h... (Official URL)