Link to graph bandwidth resources

Vectornaut 2024-05-21 07:47:14 +00:00
parent de398538ae
commit aa13921ce8

@ -32,3 +32,8 @@ 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. 1. The solution space has non-empty interior—or, equivalently, codimension zero.
2. The solution space has empty interior—or, equivalently, positive codimension. 2. The solution space has empty interior—or, equivalently, positive codimension.
3. The solution space is empty. 3. The solution space is empty.
### Choosing dependent variables
* [Graph bandwidth](https://en.wikipedia.org/wiki/Graph_bandwidth)
* [The CuthillMcKee algorithm](https://en.wikipedia.org/wiki/Cuthill%E2%80%93McKee_algorithm)