Keywords
CombinatoricsVertex (graph theory)MathematicsDegree (music)Approximation algorithmEnhanced Data Rates for GSM EvolutionDiscrete mathematicsGraphComputer sciencePhysics
Affiliated Institutions
Related Publications
Partitioning Sparse Matrices with Eigenvectors of Graphs
The problem of computing a small vertex separator in a graph arises in the context of computing a good ordering for the parallel factorization of sparse, symmetric matrices. An ...
Are randomly grown graphs really random?
We analyze a minimal model of a growing network. At each time step, a new vertex is added; then, with probability delta, two vertices are chosen uniformly at random and joined b...
Random graphs with arbitrary degree distributions and their applications
Recent work on the structure of social networks and the internet has focused attention on graphs with distributions of vertex degree that are significantly different from the Po...
Lower Bounds for the Partitioning of Graphs
Let a k-partition of a graph be a division of the vertices into k disjoint subsets containing m <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.or...
Publication Info
- Year
- 1992
- Type
- article
- Volume
- 42
- Issue
- 3
- Pages
- 153-159
- Citations
- 336
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
336
OpenAlex
Cite This
Thang Nguyen Bui,
Curt Jones
(1992).
Finding good approximate vertex and edge partitions is NP-hard.
Information Processing Letters
, 42
(3)
, 153-159.
https://doi.org/10.1016/0020-0190(92)90140-q
Identifiers
- DOI
- 10.1016/0020-0190(92)90140-q