Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
presented by Emo Welzl
The Fibonacci-Seesaw algorithm for finding the sink in a unique sink orientation too can be adapted such that it ether finds a sink or a certificate.
Let
be an orientation of the d-dimensional cube
.
Choose
two antipodal 0-dimensional subcubes
and
,
i.e. two antipodal vertices va(0) and vb(0). For
both
and
we know the sink. The idea is
to inductively grow both antipodal subcubes until we get the whole cube.
Suppose we have two antipodal subcubes
and
with sinks va(k) and vb(k). Either the outmaps of
va(k) and vb(k) are the same with respect to
and we have
found a certificate that
has not the unique sink property, or there
is a direction i for which one of the edge in va(k) and vb(k) is
ingoing and the other is outgoing. We get
and
by adding the direction i. For one of the new subcubes, say
,
the vertex
va(k+1)=va(k) stays a sink. For
the other subcube
we have to search for a new sink.
We will do this in the facet of
opposite to
.
This search will take D(k) steps. Either we find a
certificate in this small subcube and are done or we find a sink v. If vis not a sink in
together with vb(k) we have a
certificate. Otherwise
vb(k+1)=v and we can go on.