"Genus Characterizes the Complexity of Graph Problems: Some Tight Results."

Jianer Chen et al. (2003)

> Home

Details and statistics

DOI: 10.1007/3-540-45061-0_66

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/icalp/ChenKPSX03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/ChenKPSX03
Jianer Chen, Iyad A. Kanj, Ljubomir Perkovic, Eric Sedgwick, Ge Xia:
Genus Characterizes the Complexity of Graph Problems: Some Tight Results. ICALP 2003: 845-856

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.