Maximal closure of a graph and applications to combinatorial problems

Picard, J. (1976). Maximal closure of a graph and applications to combinatorial problems.

Type

Unclassified

Intellectual base

Unclassified

Year

1976

DOI

10.1287/mnsc.22.11.1268

Link

https://doi.org/10.1287/mnsc.22.11.1268

Cited by

1 citation across 1 artifact.

Domain-specific

• Closure problem
  • … transfers from A canonical instance directly demonstrates that the selected vertex set is successor-closed under every directed edge and has maximum total declared weight among all such sets. to An applied instance preserves the same invariant under a changed scale, notation, jurisdiction, dataset, or implementation..

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:d4952fa1f246 · see in the full table