Generating random spanning trees more quickly than the cover time

Wilson, D. B. (1996). Generating random spanning trees more quickly than the cover time. ACM.

Type

Book chapter

Intellectual base

Review or monograph

Year

1996

DOI

10.1145/237814.237880

Link

https://doi.org/10.1145/237814.237880

Cited by

1 citation across 1 artifact.

Domain-specific

• Maze generation algorithm
  • A maze generation algorithm automatically chooses which adjacencies are open or closed to create a navigable maze under stated structural constraints.

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