"Efficient algorithm for the vertex cover P_k problem on cacti."

Jianhua Tu (2017)

> Home

Details and statistics

DOI: 10.1016/J.AMC.2017.05.034

access: closed

type: Journal Article

metadata version: 2021-10-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/amc/Tu17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/amc/Tu17
Jianhua Tu:
Efficient algorithm for the vertex cover P_k problem on cacti. Appl. Math. Comput. 311: 217-222 (2017)

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.