Complexity of finding embeddings in a k-tree
SIAM Journal on Algebraic and Discrete Methods
On generating all maximal independent sets
Information Processing Letters
Linear time algorithms for NP-hard problems restricted to partial k-trees
Discrete Applied Mathematics
Easy problems for tree-decomposable graphs
Journal of Algorithms
Algorithms for multilevel logic optimization
Algorithms for multilevel logic optimization
Learning read-once formulas with queries
Journal of the ACM (JACM)
Combinatorial characterization of read-once formulae
Discrete Mathematics - Special issue on combinatorics and algorithms
Monadic second-order evaluations on tree-decomposable graphs
Theoretical Computer Science - Special issue on selected papers of the International Workshop on Computing by Graph Transformation, Bordeaux, France, March 21–23, 1991
Exact identification of read-once formulas using fixed points of amplification functions
SIAM Journal on Computing
On read-once Boolean functions
Poceedings of the London Mathematical Society symposium on Boolean function complexity
Learning Boolean read-once formulas over generalized bases
Journal of Computer and System Sciences
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
On the complexity of dualization of monotone disjunctive normal forms
Journal of Algorithms
Error-free and best-fit extensions of partially defined Boolean functions
Information and Computation
The Fanout Structure of Switching Functions
Journal of the ACM (JACM)
Factoring logic functions using graph partitioning
ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
Factoring and recognition of read-once functions using cographs and normality
Proceedings of the 38th annual Design Automation Conference
Logic Design and Switching Theory
Logic Design and Switching Theory
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Factoring boolean functions using graph partitioning
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
An improvement on the complexity of factoring read-once Boolean functions
Discrete Applied Mathematics
| Hi-index | 0.04 |
An approach for factoring general boolean functions was described in Golumbic and Mintz [Factoring logic functions using graph partitioning, in: Proceedings of IEEE/ACM International Conference on Computer Aided Design, November 1999, pp. 195-198] and Mintz and Golumbic [Factoring Boolean functions using graph partitioning, Discrete Appl. Math. 149 (2005) 131-153] 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.For non-read-once functions, we investigate their factoring based on their corresponding graph classes. In particular, we show that if a function F is normal and its corresponding graph is a partial k-tree, then F is a read 2k function and a read 2k formula for F can be obtained in polynomial time.