The complexity of restricted spanning tree problems¶

Papadimitriou, C. H., & Yannakakis, M. (1982). The complexity of restricted spanning tree problems. ACM.

Type: Journal article
Intellectual base: Primary research
Year: 1982
DOI: 10.1145/322307.322309
DOI registrant: Association for Computing Machinery
Link: https://doi.org/10.1145/322307.322309

Cited by¶

1 citation across 1 artifact.

Domain-specific¶

Dissociation number
- The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Verification¶

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:d08e8438312b · see in the full table