"Simple linear-time algorithms for counting independent sets in ..."

Min-Sheng Lin (2018)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2017.12.023

access: closed

type: Journal Article

metadata version: 2020-02-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dam/Lin18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/Lin18
Min-Sheng Lin:
Simple linear-time algorithms for counting independent sets in distance-hereditary graphs. Discret. Appl. Math. 239: 144-153 (2018)

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.