Robust graph coloring based on the matrix semi-tensor product with application to examination timetabling

DOI10.1007/s11768-014-0153-7zbMath1313.05139MaRDI QIDQ5497725

Yuzhen Wang, Airong Wei, Mei-Rong Xu

Publication date: 11 February 2015

Published in: Control Theory and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11768-014-0153-7

zbMATH Keywords

semi-tensor product; robust graph coloring; examination timetabling

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

05C15: Coloring of graphs and hypergraphs

Related Items

Solvability of the matrix equation \(AX^2 = B\) with semi-tensor product, Matrix formulation of EISs of graphs and its application to WSN covering problems, A real method for solving quaternion matrix equation \(\mathbf{X}-\mathbf{A}\hat{\mathbf{X}}\mathbf{B} = \mathbf{C}\) based on semi-tensor product of matrices, Matching algorithms of minimum input selection for structural controllability based on semi-tensor product of matrices, Matrix approach to formulate and search \(k\)-ESS of graphs using the STP theory, Matrix expression of finite Boolean-type algebras, Matrix expression and vaccination control for epidemic dynamics over dynamic networks

Cites Work

• A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems
• Controllability and observability of Boolean control networks
• A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints
• Realization of Boolean control networks
• Analysis and control of Boolean networks. A semi-tensor product approach.
• The robust coloring problem.
• Graph coloring for air traffic flow management
• Controllability of higher order Boolean control networks
• Stability and stabilization of Boolean networks
• Logic and logic-based control
• ALGEBRAIC APPROACH TO DYNAMICS OF MULTIVALUED NETWORKS
• A Linear Representation of Dynamics of Boolean Networks
• Disturbance Decoupling of Boolean Control Networks
• A Maximum Principle for Single-Input Boolean Control Networks