Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
- DOI
- 10.1137/1.9781611975031.176
- Published
- 2018-01
- Container
- Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms
- Publisher
- Society for Industrial and Applied Mathematics
- Open access
- unknown
Credibility signals
uncertain Score 64/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.
- supportingMetadata completeness: All 6 scored descriptive metadata groups are present.
Cite this work
BibTeX
@article{allodium:10.1137/1.9781611975031.176,
title = {Fully polynomial FPT algorithms for some classes of bounded clique-width graphs},
author = {David Coudert and Guillaume Ducoffe and Alexandra Popa},
year = {2018},
journal = {Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms},
doi = {10.1137/1.9781611975031.176},
url = {https://doi.org/10.1137/1.9781611975031.176}
}RIS
TY - JOUR TI - Fully polynomial FPT algorithms for some classes of bounded clique-width graphs AU - David Coudert AU - Guillaume Ducoffe AU - Alexandra Popa PY - 2018 JO - Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms DO - 10.1137/1.9781611975031.176 UR - https://doi.org/10.1137/1.9781611975031.176 ER -
APA
Coudert, D., Ducoffe, G., & Popa, A. (2018). Fully polynomial FPT algorithms for some classes of bounded clique-width graphs. Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. https://doi.org/10.1137/1.9781611975031.176
Source records
- crossref · retrieved 2026-09-27T03:14:06.373Z