Skip to main content

A linear time algorithm to recognize the double euler trail for series-parallel networks

  • Conference paper
  • First Online:
ISA'91 Algorithms (ISA 1991)

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

Included in the following conference series:

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. T. Lengauer and R. Muller, “Linear algorithm for optimizing the layout of dynamic CMOS cells”, IEEE Trans. on Circuits and System, vol. 35, (1988), 279–285.

    Google Scholar 

  2. R. Maziasz and J. Hayes, “Layout optimization of static CMOS functional cells”, IEEE Trans. on Computer-Aided Design., Vol. 9, No.7, (1990), 708–719.

    Google Scholar 

  3. R. Nair, A. Bruss and J. Reif, “Linear time algorithms for optimal CMOS layout”, in VLSI: Algorithms and Architectures, P. Bertolazzi and F. Luccio (Editors), Elservier Science Publishers B.V. (North-Holland), (1985), 327–338.

    Google Scholar 

  4. L. Thomas and M. Rolf, “Linear algorithms for optimizing the layout of dynamic CMOS cells”, IEEE Trans on circuits and systems, vol. 35 no. 3 (1988) 279–285.

    Google Scholar 

  5. T. Uehara and C. Van Cleemput, “Optimal layout of CMOS functional arrays”, IEEE Trans. Comput., vol. C-30, (1981), 305–312.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Wen-Lian Hsu R. C. T. Lee

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hsu, LH., Hwang, J.Y., Ho, T.Y., Tsai, C.H. (1991). A linear time algorithm to recognize the double euler trail for series-parallel networks. In: Hsu, WL., Lee, R.C.T. (eds) ISA'91 Algorithms. ISA 1991. Lecture Notes in Computer Science, vol 557. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54945-5_76

Download citation

  • DOI: https://doi.org/10.1007/3-540-54945-5_76

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54945-1

  • Online ISBN: 978-3-540-46600-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics