The complexity of restricted spanning tree problems

Christos H Papadimitriou, M. Y. (1982). The complexity of restricted spanning tree problems. ACM.

Type

Unclassified

Intellectual base

Unclassified

Year

1982

DOI

10.1145/322307.322309

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

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:d08e8438312b · see in the full table