The Complexity of Graph Connectivity

Wigderson, A. (1992). The Complexity of Graph Connectivity. Mathematical Foundations of Computer Science 1992.

Type

Book chapter

Intellectual base

Review or monograph

Year

1992

DOI

10.1007/3-540-55808-x_10

ISBN

9783540558088

Link

https://doi.org/10.1007/3-540-55808-x_10

Cited by

1 citation across 1 artifact.

Domain-specific

• Multitree
  • Furnas and Zacks use multitrees to represent multiple overlapping hierarchies while retaining navigable local tree structure. Wigderson analyzes unambiguous reachability restrictions in complexity theory.

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