"Fast and simple algorithms to count the number of vertex covers in an ..."

Min-Sheng Lin (2007)

> Home

Details and statistics

DOI: 10.1016/J.IPL.2006.12.002

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/Lin07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/Lin07
Min-Sheng Lin:
Fast and simple algorithms to count the number of vertex covers in an interval graph. Inf. Process. Lett. 102(4): 143-146 (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.