Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees

Keyphrases

• Readability 100%
• Normality 100%
• Kd-tree 100%
• Cograph 100%
• Read-once Function 100%
• Boolean Functions 66%
• Graph Partitioning 66%
• Fast Algorithm 33%
• Polynomial Time 33%
• Graph Classes 33%
• Logic Functions 33%
• International Conference 33%
• Computer-aided Design 33%
• Graph Partitioning Algorithm 33%

Mathematics

• Graph Partition 100%
• Boolean Function 66%
• Fast Algorithm 33%
• Polynomial Time 33%
• Logic Function 33%
• Aided Design 33%

Computer Science

• Graph Partition 100%
• Boolean Function 66%
• Fast Algorithm 33%
• Polynomial Time 33%
• Computer Aided Design 33%