"The algorithmic complexity of mixed domination in graphs."

Yancai Zhao, Liying Kang, Moo Young Sohn (2011)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2011.01.029

access: open

type: Journal Article

metadata version: 2021-02-17

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/tcs/ZhaoKS11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/ZhaoKS11
Yancai Zhao, Liying Kang, Moo Young Sohn:
The algorithmic complexity of mixed domination in graphs. Theor. Comput. Sci. 412(22): 2387-2392 (2011)

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.