Dividing a Graph into Triconnected Components¶
Hopcroft, J. E., & Tarjan, R. E. (1973). Dividing a Graph into Triconnected Components. SIAM Journal on Computing, 135-158.
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¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:e3b98762432c · see in the full table