A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems

DOI10.1016/j.automatica.2012.03.024zbMath1246.93010OpenAlexW2020196141MaRDI QIDQ445938

Chenghui Zhang, Zhenbin Liu, Yuzhen Wang

Publication date: 27 August 2012

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.automatica.2012.03.024

zbMATH Keywords

algorithmgraphmulti-agent systemvertex coloringnecessary and sufficient conditiongroup consensusmaximum (weight) stable set

Mathematics Subject Classification ID

Decentralized systems (93A14) Algebraic methods (93B25) Applications of graph theory to circuits and networks (94C15)

Related Items (49)

On solutions of the matrix equation \(AX=B\) with respect to semi-tensor product ⋮ Semi-tensor product of matrices approach to reachability of finite automata with application to language recognition ⋮ Weighted and near weighted potential games with application to game theoretic control ⋮ Vector space structure of finite evolutionary games and its application to strategy profile convergence ⋮ The computation of Nash equilibrium in fashion games via semi-tensor product method ⋮ Multivariable fuzzy control based mobile robot odor source localization via semitensor product ⋮ Matrix expression of finite Boolean-type algebras ⋮ Function perturbations in Boolean networks with its application in a \textit{D. melanogaster} gene network ⋮ Algebraic verification of finite group-based potential games with vector payoffs ⋮ Lyapunov-Based Stability and Construction of Lyapunov Functions for Boolean Networks ⋮ Synchronization of coupled large-scale Boolean networks ⋮ Cluster synchronization of a class of multi-agent systems with a bipartite graph topology ⋮ Two kinds of optimal controls for probabilistic mix-valued logical dynamic networks ⋮ Nonsingularity of feedback shift registers ⋮ Output tracking control of Boolean control networks via state feedback: constant reference signal case ⋮ Mean-square stability of discrete-time switched systems under modeled random switching ⋮ An algebraic expression of finite horizon optimal control algorithm for stochastic logical dynamical systems ⋮ STP Approach to Model Controlled Automata with Application to Reachability Analysis of DEDS ⋮ Set stability and set stabilization of Boolean control networks based on invariant subsets ⋮ Simultaneous stabilization for a set of Boolean control networks ⋮ Algebraic state space approach to model and control combined automata ⋮ On the number of driver nodes for controlling a Boolean network when the targets are restricted to attractors ⋮ Stability and stabilization of evolutionary games with time delays via matrix method ⋮ Dynamics and control of singular boolean networks ⋮ Topologies on quotient space of matrices via semi‐tensor product ⋮ Stability analysis of state‐triggered impulsive boolean networks based on a hybrid index model ⋮ On finite potential games ⋮ Complete synchronization of temporal Boolean networks ⋮ Controllability, reachability, and stabilizability of finite automata: a controllability matrix method ⋮ Minimum energy control and optimal-satisfactory control of Boolean control network ⋮ Matrix approach to formulate and search \(k\)-ESS of graphs using the STP theory ⋮ Stability and stabilization of a class of finite evolutionary games ⋮ Controllability of Context-Sensitive Probabilistic Mix-Valued Logical Control Networks with Constraints ⋮ Indirect unstructured hex-dominant mesh generation using tetrahedra recombination ⋮ Group consensus control for heterogeneous multi-agent systems with fixed and switching topologies ⋮ On couple-group consensus of multiagent networks with communication and input time delays ⋮ Matrix formulation of EISs of graphs and its application to WSN covering problems ⋮ General decomposition of fuzzy relations: semi-tensor product approach ⋮ Matrix expression and vaccination control for epidemic dynamics over dynamic networks ⋮ Minimum-Time State Feedback Stabilization of Constrained Boolean Control Networks ⋮ Feedback control design for the complete synchronisation of two coupled Boolean networks ⋮ \(L(p,q)\)-label coloring problem with application to channel allocation ⋮ Solving type-2 fuzzy relation equations via semi-tensor product of matrices ⋮ Robust graph coloring based on the matrix semi-tensor product with application to examination timetabling ⋮ Semi-tensor product approach to networked evolutionary games ⋮ A matrix approach to hypergraph stable set and coloring problems with its application to storing problem ⋮ On the observability of free Boolean networks via the semi-tensor product method ⋮ Matching algorithms of minimum input selection for structural controllability based on semi-tensor product of matrices ⋮ A Matrix Approach to the Analysis and Control of Networked Evolutionary Games with Bankruptcy Mechanism

Cites Work

• Unnamed Item
• Unnamed Item
• Controllability of Boolean control networks with time delays in states
• Variable space search for graph coloring
• Mean square average-consensus under measurement noises and fixed topologies: necessary and sufficient conditions
• Controllability and observability of Boolean control networks
• Synchronization of multi-agent systems without connectivity assumptions
• Realization of Boolean control networks
• Analysis and control of Boolean networks. A semi-tensor product approach.
• Consentability and protocol design of multi-agent systems with stochastic switching topology
• On the general consensus protocol of multi-agent systems with double-integrator dynamics
• On maximal independent sets of vertices in claw-free graphs
• The maximum clique problem
• The robust coloring problem.
• Graph coloring for air traffic flow management
• Group consensus in multi-agent systems with switching topologies and communication delays
• A graph coloring heuristic using partial solutions and a reactive tabu scheme
• An adaptive memory algorithm for the \(k\)-coloring problem
• A Metaheuristic Approach for the Vertex Coloring Problem
• Stability and stabilization of Boolean networks
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• A procedure for the strategic planning of locations, capacities and districting of jails: application to Chile
• Flocking of Multi-Agents With a Virtual Leader
• A Linear Representation of Dynamics of Boolean Networks
• Information Flow and Cooperative Control of Vehicle Formations
• Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
• Necessary and sufficient graphical conditions for formation control of unicycles
• Flocking for Multi-Agent Dynamic Systems: Algorithms and Theory
• Stable Flocking of Multiple Inertial Agents on Balanced Graphs
• A Maximum Principle for Single-Input Boolean Control Networks

This page was built for publication: A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems