Graph-distance to a target vertex in a simple polyhedron is at least d minus the shared tight-row count

Initializing...

Graph-distance to a target vertex in a simple polyhedron is at least d minus the shared tight-row count · Prove2Me