CORE
🇺🇦Â
 make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
slides
Optimal and Random Partitions of Random Graphs
Authors
Lenwood S. Heath
Joseph W. Lavinus
Publication date
1 July 1993
Publisher
Abstract
The behavior of random graphs with respect to graph partitioning is considered. Conditions are identified under which random graphs cannot be partitioned well, i.e., a random partition is likely to be almost as good as an optimal partition
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Computer Science Technical Reports @Virginia Tech
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:vtcstechreports.OAI2:366
Last time updated on 21/06/2013