A family of graphs with expensive depth-reduction
Part of the Lecture Notes in Computer Science book series (LNCS, volume 104)
A family of directed acyclic graphs Gn with n nodes and n lg2 n edges is constructed. It is necessary to remove Ω(n lg2 n) edges, in order to reduce depth to nɛ−0≤ɛ<1 −.
Unable to display preview. Download preview PDF.
- [P,R]W.J. Paul, R. Reischuk A graph theoretical approach to determinism versus nondeterminism To appear in Acta InformaticaGoogle Scholar
- [V]L.G. Valiant Graph theoretic arguments in low-level complexity. Proc. 6.th Symp. on Math. Found of Comp. Science, Tatranska Lominica, Czechoslovakia, 1977Google Scholar
© Springer-Verlag Berlin Heidelberg 1981