"An optimal algorithm to find minimum k-hop dominating set of interval graphs."

Sambhu Charan Barman, Madhumangal Pal, Sukumar Mondal (2019)

> Home

Details and statistics

DOI: 10.1142/S1793830919500162

access: closed

type: Journal Article

metadata version: 2021-10-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dmaa/BarmanPM19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dmaa/BarmanPM19
Sambhu Charan Barman, Madhumangal Pal, Sukumar Mondal:
An optimal algorithm to find minimum k-hop dominating set of interval graphs. Discret. Math. Algorithms Appl. 11(2): 1950016:1-1950016:18 (2019)

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.