A matrix approach to hypergraph stable set and coloring problems with its application to storing problem
From MaRDI portal
Publication:2336703
DOI10.1155/2014/783784zbMath1463.05184OpenAlexW2120423898WikidataQ59052337 ScholiaQ59052337MaRDI QIDQ2336703
Publication date: 19 November 2019
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/783784
Related Items (3)
Semi‐tensor product of quaternion matrices and its application ⋮ \(l_{1}\)-gain analysis and model reduction problem for Boolean control networks ⋮ Matching algorithms of minimum input selection for structural controllability based on semi-tensor product of matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Boolean derivative calculation with application to fault detection of combinational circuits via the semi-tensor product method
- Total colorings of planar graphs without intersecting 5-cycles
- A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems
- Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles
- Controllability of Boolean control networks with time delays in states
- Using mixed graph coloring to minimize total completion time in job shop scheduling
- Controllability and observability of Boolean control networks
- Realization of Boolean control networks
- Games on fuzzy communication structures with Choquet players
- Analysis and control of Boolean networks. A semi-tensor product approach.
- Hypergraph modeling and approximation algorithms for the minimum length link scheduling in multiuser MIMO networks
- Graph coloring for air traffic flow management
- On edge colorings of \(1\)-planar graphs
- Decomposable convexities in graphs and hypergraphs
- Packing and covering with linear programming: a survey
- A class of inequalities relating degrees of adjacent nodes to the average degree in edge-weighted uniform hypergraphs
- On packing and coloring hyperedges in a cycle
- Disturbance decoupling of mix-valued logical networks via the semi-tensor product method
- Finding the \(K\) best policies in a finite-horizon Markov decision process
- Dimension of complete simple games with minimum
- Circular mixed hypergraphs. II: The upper chromatic number
- Stability and stabilization of Boolean networks
- Scheduling Problems and Mixed Graph Colorings
- A Linear Representation of Dynamics of Boolean Networks
- Singular Boolean networks: Semi-tensor product approach
- Disturbance Decoupling of Boolean Control Networks
- A Maximum Principle for Single-Input Boolean Control Networks
This page was built for publication: A matrix approach to hypergraph stable set and coloring problems with its application to storing problem
