The following pages link to Resolving the hypercube (Q2446831):
Displaying 13 items.
- Is it possible to determine a point lying in a simplex if we know the distances from the vertices? (Q268543) (← links)
- On the metric dimension of imprimitive distance-regular graphs (Q505687) (← links)
- Reaching approximate agreement on hypercube (Q686631) (← links)
- Saving probe bits by cube domination (Q1627162) (← links)
- Symmetry properties of resolving sets and metric bases in hypercubes (Q1677292) (← links)
- On the metric dimension of incidence graphs (Q1744744) (← links)
- An IP-based swapping algorithm for the metric dimension and minimal doubly resolving set problems in hypercubes (Q2174878) (← links)
- On the metric dimension of the folded \(n\)-cube (Q2300649) (← links)
- Solving Hex: Beyond Humans (Q3073722) (← links)
- Resolvability of Hamming Graphs (Q5128504) (← links)
- (Q5866382) (← links)
- On metric dimensions of hypercubes (Q5871598) (← links)
- \( [ 1 , 2 ]\)-dimension of graphs (Q6162042) (← links)