A family of graphs with expensive depth-reduction

  • Georg Schnitger
Conference paper
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.

Unable to display preview. Download preview PDF.


  1. [E.G,S]
    P. Erdös, R.L. Graham, E. Szemerédi On sparse graphs with dense long paths. Comp. and Maths. with Appls., 1(1975) 365–369CrossRefGoogle Scholar
  2. [P,R]
    W.J. Paul, R. Reischuk A graph theoretical approach to determinism versus nondeterminism To appear in Acta InformaticaGoogle Scholar
  3. [V]
    L.G. Valiant Graph theoretic arguments in low-level complexity. Proc. Symp. on Math. Found of Comp. Science, Tatranska Lominica, Czechoslovakia, 1977Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Georg Schnitger
    • 1
  1. 1.Fakultät für MathematikUniversität BielefeldBielefeld 1West-Germany

Personalised recommendations