"An Optimal Algorithm for Finding the Minimum Cardinality Dominating Set on ..."

H. S. Chao, Fang-Rong Hsu, Richard C. T. Lee (1998)

> Home

Details and statistics

DOI: 10.1007/3-540-68535-9_35

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cocoon/ChaoHL98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoon/ChaoHL98
H. S. Chao, Fang-Rong Hsu, Richard C. T. Lee:
An Optimal Algorithm for Finding the Minimum Cardinality Dominating Set on Permutation Graphs. COCOON 1998: 309-318

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.