"An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation ..."

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

> Home

Details and statistics

DOI: 10.1007/978-3-642-10217-2_36

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/iwoca/LappasNP09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iwoca/LappasNP09
Evaggelos Lappas, Stavros D. Nikolopoulos, Leonidas Palios:
An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs. IWOCA 2009: 368-379

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.