Dividing a Graph into Triconnected Components¶
Hopcroft, J. E., & Tarjan, R. E. (1973). Dividing a Graph into Triconnected Components. SIAM Journal on Computing.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
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).
This sourceThe paper gives an O(V+E)-time and-space triconnected decomposition algorithm.
- … 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:e3b98762432c · see in the full table