- ...Reinhardt
- Supported in part
by the DFG Project La 618/3-1 KOMET.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
- ...Allender
- Supported in part by NSF grant CCR-9509603.
This work was performed while this author was a visiting scholar at the
Wilhelm-Schickard Institut für Informatik, Universität Tübingen,
supported by DFG grant TU 7/117-1
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
- ...29#29;
- More
precisely, our routine will check if, for every vertex x, there is
at most one minimal-length path from the start vertex to x. This is
sufficient for our purposes. A straightforward modification of
our routine would provide an unambiguous logspace routine that will
determine if the entire graph 23#23 is a min-unique graph.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.