From aa13921ce8797808a7e083398b784baabbac153e Mon Sep 17 00:00:00 2001
From: Vectornaut <vectornaut@nobody@nowhere.net>
Date: Tue, 21 May 2024 07:47:14 +0000
Subject: [PATCH] Link to graph bandwidth resources

---
 Gram-matrix-parameterization.md | 7 ++++++-
 1 file changed, 6 insertions(+), 1 deletion(-)

diff --git a/Gram-matrix-parameterization.md b/Gram-matrix-parameterization.md
index c556787..13edc52 100644
--- a/Gram-matrix-parameterization.md
+++ b/Gram-matrix-parameterization.md
@@ -31,4 +31,9 @@ For $G$ to be realizable as a Gram matrix, it's necessary for each dependent var
 
 1. The solution space has non-empty interior—or, equivalently, codimension zero.
 2. The solution space has empty interior—or, equivalently, positive codimension.
-3. The solution space is empty.
\ No newline at end of file
+3. The solution space is empty.
+
+### Choosing dependent variables
+
+* [Graph bandwidth](https://en.wikipedia.org/wiki/Graph_bandwidth)
+* [The Cuthill–McKee algorithm](https://en.wikipedia.org/wiki/Cuthill%E2%80%93McKee_algorithm)
\ No newline at end of file