"An O(n)-time algorithm for the paired domination problem on permutation ..."

Evaggelos Lappas, Stavros D. Nikolopoulos, Leonidas Palios (2013)

> Home

Details and statistics

DOI: 10.1016/J.EJC.2011.10.011

access: open

type: Journal Article

metadata version: 2022-10-02

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/ejc/LappasNP13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ejc/LappasNP13
Evaggelos Lappas, Stavros D. Nikolopoulos, Leonidas Palios:
An O(n)-time algorithm for the paired domination problem on permutation graphs. Eur. J. Comb. 34(3): 593-608 (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.