"Maximum independent set for intervals by divide and conquer with pruning."

Jack Snoeyink (2007)

> Home

Details and statistics

DOI: 10.1002/NET.20150

access: closed

type: Journal Article

metadata version: 2018-11-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/networks/Snoeyink07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/Snoeyink07
Jack Snoeyink:
Maximum independent set for intervals by divide and conquer with pruning. Networks 49(2): 158-159 (2007)

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.