Approximation Algorithms for Finding Highly Connected Subgraphs

Khuller, S. (1997). Approximation Algorithms for Finding Highly Connected Subgraphs.

Type

Unclassified

Intellectual base

Unclassified

Year

1997

Link

no authoritative link yet

Cited by

1 citation across 1 artifact.

Domain-specific

• Strong connectivity augmentation
  • 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:8108c85fbb64 · see in the full table