"A linear time algorithm for computing a minimum paired-dominating set of a ..."

B. S. Panda, Dinabandhu Pradhan (2013)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2012.04.014

access: open

type: Journal Article

metadata version: 2025-05-31

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dam/PandaP13a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/PandaP13a
B. S. Panda, Dinabandhu Pradhan:
A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph. Discret. Appl. Math. 161(12): 1776-1783 (2013)

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.