"Finding Good Approximate Vertex and Edge Partitions is NP-Hard."

Thang Nguyen Bui, Curt Jones (1992)

> Home

Details and statistics

DOI: 10.1016/0020-0190(92)90140-Q

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/BuiJ92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/BuiJ92
Thang Nguyen Bui, Curt Jones:
Finding Good Approximate Vertex and Edge Partitions is NP-Hard. Inf. Process. Lett. 42(3): 153-159 (1992)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.