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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 959, Issue , 1995, Pages 229-234

  Hayase, Kazuyoshi ^a   Sadakane, Kunihiko ^a   Tani, Seiichiro ^a,b  

^a UNIVERSITY OF TOKYO   (Japan)

^b NTT CORPORATION   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; GRAPH THEORY;

MAXIMAL INDEPENDENT SET; OBDD CONSTRUCTION;

COMPUTATION THEORY;

EID: 84875560313     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0030837     Document Type: Conference Paper

References (6)

1. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Trans, on Computers, C-35(8):677-691, 1986.
2. O. Coudert. Doing two-level logic minimization 100 times faster. In Proc. ACM-SIAM Symposium on Discrete Algorithms, pages 112-121, 1995.
3. D. S. Johnson, M. Yannakakis, and H. Papadimitriou. On generating all maximal independent sets. Information Processing Letters, 27:119-123, 1988.
4. E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan. Generating all maximal independent sets: JVP-hardness and polynomial-time algorithms. SIAM J. Comput., 9(3):558-565, 1980.
5. S. Tani and H. Imai. A reordering operation for an ordered binary decision diagram and an extended framework for combinatorics of graphs. In ISAAC94, Lecture Notes in Computer Science, volume 834, pages 575-583, 1994.
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.