Cut Tree Algorithms

A. V Goldberg, T. (1136). Cut Tree Algorithms: An Experimental Study.

Type

Unclassified

Intellectual base

Unclassified

Year

1136

DOI

10.1006/jagm.2000.1136

Link

https://doi.org/10.1006/jagm.2000.1136

Cited by

1 citation across 1 artifact.

Domain-specific

• Gomory–Hu tree
  • … the input graph is undirected with declared nonnegative capacities, the tree has the same vertices, and every vertex pair's minimum cut equals the least edge weight on its unique tree path. 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:1c7251b415e0 · see in the full table