Skip to main content
SpringerLink
Log in

Output-size sensitiveness of OBDD construction through maximal independent set problem

  • Session 4A: Graph Algorithms
  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 1995)

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

Included in the following conference series:

Abstract

This paper investigates output-size sensitiveness of construction of OBDD by analyzing the maximal independent set problem of a graph, which would give several insights to efficient manipulation of Boolean functions by OBDD and graph theory.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Trans. on Computers, C-35(8):677–691, 1986.

    Google Scholar 

  2. O. Coudert. Doing two-level logic minimization 100 times faster. In Proc. ACM-SIAM Symposium on Discrete Algorithms, pages 112–121, 1995.

    Google Scholar 

  3. D. S. Johnson, M. Yannakakis, and H. Papadimitriou. On generating all maximal independent sets. Information Processing Letters, 27:119–123, 1988.

    Article  Google Scholar 

  4. E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan. Generating all maximal independent sets: NP-hardness and polynomial-time algorithms. SIAM J. Comput., 9(3):558–565, 1980.

    Article  Google Scholar 

  5. S. Tani and H. Imai. A reordering operation for an ordered binary decision diagram and an extended framework for combinatorics of graphs. In ISAAC'94, Lecture Notes in Computer Science, volume 834, pages 575–583, 1994.

    Google Scholar 

  6. S. Tsukiyama, M. Ide, H. Ariyoshi, and I. Shirakawa. A new algorithm for generating all the maximal independent sets. SIAM J. Comput., 6(3):505–517, 1977.

    Article  Google Scholar 

Download references

Author information

Author notes

  1. Seiichiro Tani

    Present address: Nippon Telegraph and Telephone Corporation, Japan

Authors and Affiliations

  1. Department of Information Science, University of Tokyo, Hongo, 113, Tokyo, Japan

    Kazuyoshi Hayase, Kunihiko Sadakane & Seiichiro Tani

Authors
  1. Kazuyoshi Hayase
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kunihiko Sadakane
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Seiichiro Tani
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ding-Zhu Du Ming Li

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hayase, K., Sadakane, K., Tani, S. (1995). Output-size sensitiveness of OBDD construction through maximal independent set problem. In: Du, DZ., Li, M. (eds) Computing and Combinatorics. COCOON 1995. Lecture Notes in Computer Science, vol 959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030837

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-44733-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation