"All maximal independent sets and dynamic dominance for sparse graphs."

David Eppstein (2009)

> Home

Details and statistics

DOI: 10.1145/1597036.1597042

access: closed

type: Journal Article

metadata version: 2019-06-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/talg/Eppstein09b
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/Eppstein09b
David Eppstein:
All maximal independent sets and dynamic dominance for sparse graphs. ACM Trans. Algorithms 5(4): 38:1-38:14 (2009)

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.