A characterization of signed hypergraphs and its applications to VLSI via minimization and logic synthesis
From MaRDI portal
Publication:1276973
DOI10.1016/S0166-218X(98)00092-4zbMath0913.68104OpenAlexW1986806038MaRDI QIDQ1276973
Publication date: 2 February 1999
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)
Related Items (11)
A connection between Hadamard matrices, oriented hypergraphs and signed graphs ⋮ A spectral method to incidence balance of oriented hypergraphs and induced signed hypergraphs ⋮ Unnamed Item ⋮ A Dynamic Programming Algorithm To Test A Signed Graph For Balance ⋮ A characterization of oriented hypergraphic Laplacian and adjacency matrix coefficients ⋮ Oriented hypergraphs: introduction and balance ⋮ Signed intersection graphs ⋮ Dualization of Boolean functions using ternary decision diagrams ⋮ A characterization of oriented hypergraphic balance via signed weak walks ⋮ Oriented hypergraphic matrix-tree type theorems and bidirected minors via Boolean order ideals ⋮ Spectra of cycle and path families of oriented hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Alpha-balanced graphs and matrices and GF(3)-representability of matroids
- Some simplified NP-complete graph problems
- On the notion of balance of a signed graph
- On a Class of Totally Unimodular Matrices
- Structural properties and recognition of restricted and strongly unimodular matrices
- Graph Bipartization and via minimization
- A graph-theoretic via minimization algorithm for two-layer printed circuit boards
- Node-and edge-deletion NP-complete problems
- Balanced matrices
- A characterization of consistent marked graphs
This page was built for publication: A characterization of signed hypergraphs and its applications to VLSI via minimization and logic synthesis