5/10/2023 0 Comments Books like spqr![]() ![]() Making changes to this structure, we can now observe how the graph represented by the SPQR-tree changes, instead of having to reason which updates to the SPQR-tree are necessary after a change to the represented graph. We do this working along an axiomatic definition lifting the SPQR-tree to a stand-alone data structure that can be modified independently from the graph it might have been derived from. This allows us to efficiently merge two SPQR-trees by identifying the edges incident to two vertices with each other. ![]() In this paper, we study the problem of dynamically maintaining an SPQR-tree while expanding vertices into arbitrary biconnected graphs. SPQR-trees model the decomposition of a graph into triconnected components. ![]()
0 Comments
Leave a Reply. |