ScholarLens Back to search
1993•IEE Proceedings E Computers and Digital TechniquesRequires access

Synthesis for Reed-Muller directed acyclic graph network

Hau‐Tieng Wu, N. Zhuang, Marek A. Perkowski

Open publisher page 1 citations

Abstract

A synthesis algorithm tor Reed-Muller directed acyclic graph (DAG) networks is presented. Based on the circuit cost matrix, the algorithm grows the DAG network from inputs to output, and thus allows the formulation of more accurate criteria for variable selection. By using this algorithm, the quasiminimum DAG network can be found with (n+2)(n−1)/2 variable assignments.

About this research paper

What this paper is about

A synthesis algorithm tor Reed-Muller directed acyclic graph (DAG) networks is presented. Based on the circuit cost matrix, the algorithm grows the DAG network from inputs to output, and thus allows the formulation of more accurate criteria for variable selection. By using this algorithm, the quasiminimum DAG network can be found with (n+2)(n−1)/2 variable assignments.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

A synthesis algorithm tor Reed-Muller directed acyclic graph (DAG) networks is presented. Based on the circuit cost matrix, the algorithm grows the DAG network from inputs to output, and thus allows the formulation of more accurate criteria for variable selection. By using this algorithm, the quasiminimum DAG network can be found with (n+2)(n−1)/2 variable assignments.

Key concepts: Directed acyclic graph, Directed graph, Computer science, Variable (mathematics), Graph, Algorithm, Moral graph, Mathematics

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Synthesis for Reed-Muller directed acyclic graph network — Research Paper | ScholarLens