A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems
From MaRDI portal
Publication:445938
DOI10.1016/J.AUTOMATICA.2012.03.024zbMATH Open1246.93010OpenAlexW2020196141MaRDI QIDQ445938FDOQ445938
Authors: Yuzhen Wang, Chenghui Zhang, Zhenbin Liu 
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
Recommendations
- A matrix approach to hypergraph stable set and coloring problems with its application to storing problem
- Approximating maximum stable set and minimum graph coloring problems with the positive semidefinite relaxation
- Solving vertex coloring problems as maximum weight stable set problems
- Maximum-weight stable sets and safe lower bounds for graph coloring
- The \(r\)-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size
- Graph coloring by multiagent fusion search
- scientific article; zbMATH DE number 7453150
- An exact algorithm for the maximum stable set problem
- A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring
- The struction algorithm for the maximum stable set problem revisited
graphalgorithmmulti-agent systemgroup consensusvertex coloringnecessary and sufficient conditionmaximum (weight) stable set
Decentralized systems (93A14) Applications of graph theory to circuits and networks (94C15) Algebraic methods (93B25)
Cites Work
- The maximum clique problem
- Title not available (Why is that?)
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Flocking for Multi-Agent Dynamic Systems: Algorithms and Theory
- Flocking of Multi-Agents With a Virtual Leader
- Consentability and protocol design of multi-agent systems with stochastic switching topology
- A Linear Representation of Dynamics of Boolean Networks
- Information Flow and Cooperative Control of Vehicle Formations
- Necessary and sufficient graphical conditions for formation control of unicycles
- A Maximum Principle for Single-Input Boolean Control Networks
- Controllability of Boolean control networks with time delays in states
- Controllability and observability of Boolean control networks
- Analysis and control of Boolean networks. A semi-tensor product approach.
- On maximal independent sets of vertices in claw-free graphs
- Group consensus in multi-agent systems with switching topologies and communication delays
- Stability and stabilization of Boolean networks
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Mean square average-consensus under measurement noises and fixed topologies: necessary and sufficient conditions
- Title not available (Why is that?)
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- The robust coloring problem.
- On the general consensus protocol of multi-agent systems with double-integrator dynamics
- Graph coloring for air traffic flow management
- Stable Flocking of Multiple Inertial Agents on Balanced Graphs
- Variable space search for graph coloring
- An adaptive memory algorithm for the \(k\)-coloring problem
- A metaheuristic approach for the vertex coloring problem
- Realization of Boolean control networks
- A procedure for the strategic planning of locations, capacities and districting of jails: application to Chile
- Synchronization of multi-agent systems without connectivity assumptions
Cited In (49)
- Simultaneous stabilization for a set of Boolean control networks
- Set stability and set stabilization of Boolean control networks based on invariant subsets
- Function perturbations in Boolean networks with its application in a \textit{D. melanogaster} gene network
- Topologies on quotient space of matrices via semi‐tensor product
- Robust graph coloring based on the matrix semi-tensor product with application to examination timetabling
- An algebraic expression of finite horizon optimal control algorithm for stochastic logical dynamical systems
- Matching algorithms of minimum input selection for structural controllability based on semi-tensor product of matrices
- On finite potential games
- On solutions of the matrix equation \(AX=B\) with respect to semi-tensor product
- Nonsingularity of feedback shift registers
- Synchronization of coupled large-scale Boolean networks
- Matrix approach to formulate and search \(k\)-ESS of graphs using the STP theory
- Indirect unstructured hex-dominant mesh generation using tetrahedra recombination
- Stability analysis of state‐triggered impulsive boolean networks based on a hybrid index model
- Stability and stabilization of evolutionary games with time delays via matrix method
- On couple-group consensus of multiagent networks with communication and input time delays
- Mean-square stability of discrete-time switched systems under modeled random switching
- Algebraic verification of finite group-based potential games with vector payoffs
- Dynamics and control of singular boolean networks
- Weighted and near weighted potential games with application to game theoretic control
- General decomposition of fuzzy relations: semi-tensor product approach
- Two kinds of optimal controls for probabilistic mix-valued logical dynamic networks
- Matrix expression of finite Boolean-type algebras
- Lyapunov-Based Stability and Construction of Lyapunov Functions for Boolean Networks
- Matrix formulation of EISs of graphs and its application to WSN covering problems
- 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
- Controllability of context-sensitive probabilistic mix-valued logical control networks with constraints
- Solving type-2 fuzzy relation equations via semi-tensor product of matrices
- Stability and stabilization of a class of finite evolutionary games
- Minimum-time state feedback stabilization of constrained Boolean control networks
- Cluster synchronization of a class of multi-agent systems with a bipartite graph topology
- Output tracking control of Boolean control networks via state feedback: constant reference signal case
- Multivariable fuzzy control based mobile robot odor source localization via semitensor product
- A Matrix Approach to the Analysis and Control of Networked Evolutionary Games with Bankruptcy Mechanism
- Group consensus control for heterogeneous multi-agent systems with fixed and switching topologies
- Matrix expression and vaccination control for epidemic dynamics over dynamic networks
- Minimum energy control and optimal-satisfactory control of Boolean control network
- Complete synchronization of temporal Boolean networks
- \(L(p,q)\)-label coloring problem with application to channel allocation
- A matrix approach to hypergraph stable set and coloring problems with its application to storing problem
- STP Approach to Model Controlled Automata with Application to Reachability Analysis of DEDS
- A semi-tensor product approach to networked evolutionary games
- Semi-tensor product of matrices approach to reachability of finite automata with application to language recognition
- Algebraic state space approach to model and control combined automata
- Feedback control design for the complete synchronisation of two coupled Boolean networks
- On the observability of free Boolean networks via the semi-tensor product method
- On the number of driver nodes for controlling a Boolean network when the targets are restricted to attractors
- Controllability, reachability, and stabilizability of finite automata: a controllability matrix method
This page was built for publication: A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q445938)
