From 9b896766ea5feeb3c80866a4dabde75565a43398 Mon Sep 17 00:00:00 2001
From: Douglas Rumbaugh <dbr4@psu.edu>
Date: Fri, 16 May 2025 16:02:33 -0400
Subject: updates

---
 chapters/dynamization.tex | 1 +
 1 file changed, 1 insertion(+)

(limited to 'chapters/dynamization.tex')

diff --git a/chapters/dynamization.tex b/chapters/dynamization.tex
index c21bfbc..0ee77d3 100644
--- a/chapters/dynamization.tex
+++ b/chapters/dynamization.tex
@@ -625,6 +625,7 @@ decomposable}. These are decomposable search problems for which the
 underlying data structure supports a delete operation. More formally,
 
 \begin{definition}[Deletion Decomposable Search Problem~\cite{merge-dsp}]
+    \label{def:background-ddsp}
     A decomposable search problem, $F$, and its data structure,
     $\mathcal{I}$, is deletion decomposable if and only if, for some
     instance $\mathscr{I} \in \mathcal{I}$, containing $n$ records,
-- 
cgit v1.2.3

