"The algorithmic complexity of the minus clique-transversal problem."

Guangjun Xu et al. (2007)

> Home

Details and statistics

DOI: 10.1016/J.AMC.2006.12.027

access: closed

type: Journal Article

metadata version: 2020-02-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/amc/XuSKC07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/amc/XuSKC07
Guangjun Xu, Erfang Shan, Liying Kang, T. C. Edwin Cheng:
The algorithmic complexity of the minus clique-transversal problem. Appl. Math. Comput. 189(2): 1410-1418 (2007)

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.