Journal article
Bisecting sparse random graphs.
- Abstract:
-
Consider partitions of the vertex set of a graph G into two sets with sizes differing by at most 1: the bisection width of G is the minimum over all such partitions of the number of "cross edges" between the parts. We are interested in sparse random graphs Gn,c/n with edge probability c/n. We show that, if c > ln 4, then the bisection width is Ω(n) with high probability; while if c < ln 4, then it is equal to 0 with high probability. There are corresponding threshold results for partiti...
Expand abstract
- Publication status:
- Published
Actions
Access Document
- Publisher copy:
- 10.1002/1098-2418(200101)18:1<31::AID-RSA3>3.0.CO;2-1
Why is the content I wish to access not available via ORA?
Bibliographic data (the information relating to research outputs) and full-text items (e.g. articles, theses, reports, etc.) arrive in ORA from several different sources. Unfortunately we are not able to make available the full-text for every research output.
Please contact the ORA team (
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
Content may be unavailable for the following four reasons
-
Version unsuitable
-
We have not obtained a suitable full-text for a given research output. See this page for more information.
-
Recently completed
-
Sometimes content is held in ORA but is unavailable for a fixed period of time to comply with the policies and wishes of rights holders.
-
Permissions
-
All content made available in ORA should comply with relevant rights, such as copyright. See this page for more information.
-
Clearance
-
Some thesis volumes scanned as part of the digitisation scheme funded by Dr Leonard Polonsky are currently unavailable due to sensitive material or uncleared third-party copyright content. We are attempting to contact authors whose theses are affected.
Alternative access to the full-text
You may be able to access the full-text directly from the publisher's website using the 'Publisher Copy' link in the 'Links & Downloads' box from a research output's ORA record page. This method may require an institutional or individual subscription to the journal/resource.
Authors
Bibliographic Details
- Journal:
- Random Struct. Algorithms
- Volume:
- 18
- Issue:
- 1
- Pages:
- 31-38
- Publication date:
- 2001-01-01
- DOI:
- ISSN:
-
1042-9832
- Source identifiers:
-
102309
Item Description
- Language:
- English
- Pubs id:
-
pubs:102309
- UUID:
-
uuid:b34475ea-02fa-4825-ac49-10882880c096
- Local pid:
- pubs:102309
- Deposit date:
- 2012-12-19
Terms of use
- Copyright date:
- 2001
If you are the owner of this record, you can report an update to it here: Report update to this record