"Complexity of Graph Partition Problems."

Tomás Feder et al. (1999)

> Home

Details and statistics

DOI: 10.1145/301250.301373

access: closed

type: Conference or Workshop Paper

metadata version: 2020-01-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stoc/FederHKM99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/FederHKM99
Tomás Feder, Pavol Hell, Sulamita Klein, Rajeev Motwani:
Complexity of Graph Partition Problems. STOC 1999: 464-472

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.