Fast, effective vertex cover kernelization: a tale of two algorithms
- DOI
- 10.1109/aiccsa.2005.1387015
- Published
- Not recorded
- Container
- The 3rd ACS/IEEE International Conference onComputer Systems and Applications, 2005.
- Publisher
- IEEE
- Open access
- unknown
Credibility signals
uncertain Score 58/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.
Show all credibility signals
- supportingDOI registered: A matching record was returned by Crossref.
- supportingDOI resolves: A matching record was returned by Crossref.
- not scoredDirectory of Open Access Journals: No matching DOAJ record was present in this response. No allow-list match; this is not evidence of low credibility.
- not scoredMEDLINE indexed: Not checked or no result supplied; no credibility inference made.
- not scoredOpenAlex core source: Not checked or no result supplied; no credibility inference made.
- not scoredKnown publisher allow-list: Not checked or no result supplied; no credibility inference made.
- not scoredROR affiliation: Not checked or no result supplied; no credibility inference made.
- not scoredRetraction Watch retraction: No retraction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch expression of concern: No expression of concern notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch correction: No correction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch reinstatement: No reinstatement notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredOpen access status: Not checked or no result supplied; no credibility inference made.
- not scoredPublication license: Not checked or no result supplied; no credibility inference made.
- not scoredPublication version: A publication version was supplied but is not scored.
- cautionMetadata completeness: 5 of 6 scored descriptive metadata groups are present; missing fields increase uncertainty.
Cite this work
BibTeX
@article{allodium:10.1109/aiccsa.2005.1387015,
title = {Fast, effective vertex cover kernelization: a tale of two algorithms},
author = {F.N. Abu-Khzam and M.A. Langston and W.H. Suters},
journal = {The 3rd ACS/IEEE International Conference onComputer Systems and Applications, 2005.},
doi = {10.1109/aiccsa.2005.1387015},
url = {https://doi.org/10.1109/aiccsa.2005.1387015}
}RIS
TY - JOUR TI - Fast, effective vertex cover kernelization: a tale of two algorithms AU - F.N. Abu-Khzam AU - M.A. Langston AU - W.H. Suters JO - The 3rd ACS/IEEE International Conference onComputer Systems and Applications, 2005. DO - 10.1109/aiccsa.2005.1387015 UR - https://doi.org/10.1109/aiccsa.2005.1387015 ER -
APA
Abu-Khzam, F., Langston, M., & Suters, W. (n.d.). Fast, effective vertex cover kernelization: a tale of two algorithms. The 3rd ACS/IEEE International Conference onComputer Systems and Applications, 2005.. https://doi.org/10.1109/aiccsa.2005.1387015
Source records
- crossref · retrieved 2026-09-26T02:09:37.532Z