Routing and sorting on the graph G(n,k) of the Johnson Scheme
The graph G(n,k) of the Johnson Scheme which is also known as the "Slice of the Cube" is the undirected graph where the vertices are all the k-subsets of the fixed n-set. Two vertices A and B are adjacent if and only lA ^ Bl = k-1. This graph has been studied extensively and some propertie...
| Huvudupphovsman: | |
|---|---|
| Materialtyp: | Lärdomsprov |
| Språk: | English |
| Publicerad: |
2001.
|
| Ämnen: |