Factoring and recognition of read-once functions using cographs and normality

M. C. Golumbic, A. Mintz, U. Rotics

Research output: Contribution to journalConference articlepeer-review


An approach for factoring general boolean functions was described in [5] which is based on graph partitioning algorithms. In this paper, we present a very fast algorithm for recognizing and factoring read-once functions which is needed as a dedicated factoring subroutine to handle the lower levels of that factoring process. The algorithm is based on algorithms for cograph recognition and on checking normality. Our method has been implemented in the SIS environment, and an empirical evaluation is given.

Original languageEnglish
Pages (from-to)109-114
Number of pages6
JournalProceedings - Design Automation Conference
StatePublished - 2001
Externally publishedYes
Event38th Design Automation Conference - Las Vegas, NV, United States
Duration: 18 Jun 200122 Jun 2001


  • Cograph
  • Factoring
  • Normality
  • Read-once functions

ASJC Scopus subject areas

  • Hardware and Architecture
  • Control and Systems Engineering


Dive into the research topics of 'Factoring and recognition of read-once functions using cographs and normality'. Together they form a unique fingerprint.

Cite this