Finding biconnected components and computing tree functions in logarithmic parallel time

R.E Tarjan, U. V. (1984). Finding biconnected components and computing tree functions in logarithmic parallel time.

Type

Unclassified

Intellectual base

Unclassified

Year

1984

DOI

10.1109/sfcs.1984q5896

Link

https://doi.org/10.1109/sfcs.1984q5896

Cited by

1 citation across 1 artifact.

Domain-specific

• Euler tour technique
  • Static parallel ETT and dynamic Euler-tour trees use related encodings but different data structures; root choice, arc order and repeated vertex occurrences determine query formulas.

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