A Linear Time Implementation of SPQR-Trees

Gutwenger, C., & Mutzel, P. (2001). A Linear Time Implementation of SPQR-Trees. Graph Drawing: GD 2000.

Type

Book chapter

Intellectual base

Review or monograph

Year

2001

DOI

10.1007/3-540-44541-2_8

ISBN

9783540415541

Link

https://doi.org/10.1007/3-540-44541-2_8

Cited by

1 citation across 1 artifact.

Domain-specific

• SPQR Tree
  • … has a cycle or polygon skeleton (series structure), a P-node has a bond or dipole of parallel edges between two vertices (parallel structure), a Q-node represents an original graph edge under conventions that retain such nodes, and an R-node has a genuinely 3-connected skeleton (rigid structure).

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