Skip to main content
SpringerLink
Log in
Book cover

Theoretical Computer Science pp 91–97Cite as

A family of graphs with expensive depth-reduction

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 104))

Abstract

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 −.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. Erdös, R.L. Graham, E. Szemerédi On sparse graphs with dense long paths. Comp. and Maths. with Appls., 1(1975) 365–369

    Article  Google Scholar 

  2. W.J. Paul, R. Reischuk A graph theoretical approach to determinism versus nondeterminism To appear in Acta Informatica

    Google Scholar 

  3. L.G. Valiant Graph theoretic arguments in low-level complexity. Proc. 6.th Symp. on Math. Found of Comp. Science, Tatranska Lominica, Czechoslovakia, 1977

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fakultät für Mathematik, Universität Bielefeld, 4800, Bielefeld 1, West-Germany

    Georg Schnitger

Authors
  1. Georg Schnitger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Peter Deussen

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schnitger, G. (1981). A family of graphs with expensive depth-reduction. In: Deussen, P. (eds) Theoretical Computer Science. Lecture Notes in Computer Science, vol 104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017301

Download citation

  • DOI: https://doi.org/10.1007/BFb0017301

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10576-3

  • Online ISBN: 978-3-540-38561-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation