On the complexity of edge-colored subgraph partitioning problems in network optimization
- DOI
- 10.46298/dmtcs.2159
- Published
- 7
- Container
- Discrete Mathematics & Theoretical Computer Science
- Publisher
- Not recorded
- Open access
- yes
Credibility signals
uncertain Score 53/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.
Show all credibility signals
- cautionDOI registered: No matching Crossref record was present in this response.
- cautionDOI resolves: No matching Crossref record was present in this response.
- supportingDirectory of Open Access Journals: A matching record was returned by DOAJ.
- 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.
- supportingOpen access status: Normalized open-access status: open.
- 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.46298/dmtcs.2159,
title = {On the complexity of edge-colored subgraph partitioning problems in network optimization},
author = {Xiaoyan Zhang and Zan-Bo Zhang and Hajo Broersma and Xuelian Wen},
year = {2016},
journal = {Discrete Mathematics \& Theoretical Computer Science},
doi = {10.46298/dmtcs.2159},
url = {https://doi.org/10.46298/dmtcs.2159}
}RIS
TY - JOUR TI - On the complexity of edge-colored subgraph partitioning problems in network optimization AU - Xiaoyan Zhang AU - Zan-Bo Zhang AU - Hajo Broersma AU - Xuelian Wen PY - 2016 JO - Discrete Mathematics & Theoretical Computer Science DO - 10.46298/dmtcs.2159 UR - https://doi.org/10.46298/dmtcs.2159 ER -
APA
Zhang, X., Zhang, Z., Broersma, H., & Wen, X. (2016). On the complexity of edge-colored subgraph partitioning problems in network optimization. Discrete Mathematics & Theoretical Computer Science. https://doi.org/10.46298/dmtcs.2159