diff options
author | Marcin Chrzanowski <mc370754@students.mimuw.edu.pl> | 2021-12-13 16:28:40 +0100 |
---|---|---|
committer | Marcin Chrzanowski <mc370754@students.mimuw.edu.pl> | 2021-12-13 16:39:51 +0100 |
commit | 422f732e62b027039d5820f42b8d10bd9da8afef (patch) | |
tree | 33e55a0be0dbf468de4c9c53c91a14e4d2b65049 /mgr.tex | |
parent | d3a975403172ae848aaab98c4894442627edb6f0 (diff) |
Add partition figure
Diffstat (limited to 'mgr.tex')
-rw-r--r-- | mgr.tex | 16 |
1 files changed, 16 insertions, 0 deletions
@@ -869,6 +869,22 @@ singletons constructed according to the following rules: were assigned to parts when its children were handled. \end{enumerate} +\begin{figure} + \centering + \def\svgwidth{\columnwidth} + \input{partition.pdf_tex} + \caption{ + An LCA-partition of the tree with respect to the black vertices. The + dark grey vertices are added when computing the LCA closure, the light + grey vertices are the final vertices needed to create a minimal + partition ready set containing the black vertices. Part (a) is an + example of a singleton, part (b) of a subtree with a hole, and (c) of a + subtree. + }\label{partition-figure} +\end{figure} + +See Figure \ref{partition-figure} for an example of a partitioned tree. + If $W$ is not parition ready, we will define the LCA partition with respect to $W$ the partition with respect to the minimal partition ready set that contains $W$. Skipping ahead, the LCA partition of the set of vertices relabeled in a |