The minimization of Boolean function using Hamiltonian cycles

MaRDI QIDQ3371476zbMATH OpenFDO

Authors Pinar Dundar

Publication date 21 February 2006

zbMATH Keywords

application of Boolean algebraapplications of graph theoryBoolean functionEulerian and Hamiltonian graphsswitching theory

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Boolean functions (06E30) Applications of graph theory to circuits and networks (94C15)

Cited in

(6)

• Finding a Hamiltonian cycle by finding the global minimizer of a linearly constrained problem
• scientific article; zbMATH DE number 4168716 (Why is no real title available?)
• Directed projection graph of \(N\)-dimensional hypercube and subhypercube decomposition of balanced linearly separable Boolean functions
• Boolean expression based on hypergraphs with algorithm
• Truth Graph: A Novel Method for Minimizing Boolean Algebra Expressions by Using Graphs
• Realization of Boolean functions by combinational circuits embedded in the hypercube

This page was built for publication: The minimization of Boolean function using Hamiltonian cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3371476)