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

DOI10.1007/S11768-014-0153-7MaRDI QIDQ5497725zbMATH OpenOpenAlexFDO

Authors 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

examination timetablingrobust graph coloringsemi-tensor product

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths
• University timetabling via graph coloring: an alternative approach
• A hybrid algorithm for the robust graph coloring problem
• An application of edge coloring of graphs to a class scheduling problem
• A graph coloring algorithm for large scale scheduling problems
• A supernodal formulation of vertex colouring with applications in course timetabling
• A semidefinite programming-based heuristic for graph coloring
• scientific article; zbMATH DE number 7203465
• A column generation based algorithm for the robust graph coloring problem

Cites work

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

Cited in

(9)

• 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
• A matrix approach to hypergraph stable set and coloring problems with its application to storing problem
• Matrix expression of finite Boolean-type algebras
• Matrix expression and vaccination control for epidemic dynamics over dynamic networks
• Semi‐tensor product of quaternion matrices and its application

This page was built for publication: Robust graph coloring based on the matrix semi-tensor product with application to examination timetabling

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