Finding Good Approximate Vertex and Edge Partitions is NP-Hard

Sorry, there's nothing here.

Topics

Statistics

0102030'96'98'00'02'04'06'08'10'12'14'16'18
Citations per Year

273 Citations

Semantic Scholar estimates that this publication has 273 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Bui1992FindingGA, title={Finding Good Approximate Vertex and Edge Partitions is NP-Hard}, author={Thang Nguyen Bui and Curt Jones}, journal={Inf. Process. Lett.}, year={1992}, volume={42}, pages={153-159} }