"Maximum independent sets of circular-arc graphs: Simplified algorithm and ..."

Si-Qing Zheng (1996)

> Home

Details and statistics

DOI: 10.1002/(SICI)1097-0037(199608)28:1<15::AID-NET3>3.0.CO;2-G

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/networks/Zheng96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/Zheng96
Si-Qing Zheng:
Maximum independent sets of circular-arc graphs: Simplified algorithm and proofs. Networks 28(1): 15-19 (1996)

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.