Graphs and Cubes

Sergei Ovchinnikov, G. (2011). Graphs and Cubes. Springer.

Type

Book

Intellectual base

Review or monograph

Year

2011

Link

no authoritative link yet

Cited by

1 citation across 1 artifact.

Domain-specific

• Partial cube
  • … and assign one bit to each edge, setting a vertex's bit when its root path crosses that edge; Hamming distance then counts exactly the edges between any two vertices. to A recognition algorithm computes Djoković–Winkler edge classes, verifies the required convex partitions and constructs an isometric bit labeling..

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:447f9658fd26 · see in the full table