Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"An $$O(n+m)$$ time algorithm for computing a minimum semitotal dominating ..."

Dinabandhu Pradhan, Saikat Pal (2021)

> Home

Details and statistics

DOI: 10.1007/S12190-020-01459-9

access: closed

type: Journal Article

metadata version: 2023-06-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jamc/PradhanP21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jamc/PradhanP21
Dinabandhu Pradhan, Saikat Pal:
An $$O(n+m)$$ time algorithm for computing a minimum semitotal dominating set in an interval graph. J. Appl. Math. Comput. 66(1-2): 733-747 (2021)

a service of

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.