A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems
From MaRDI portal
(Redirected from Publication:445938)
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
- Distributed answer set coloring: stable models computation via graph coloring
- 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
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3445275 (Why is no real title available?)
- A Linear Representation of Dynamics of Boolean Networks
- A Maximum Principle for Single-Input Boolean Control Networks
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- A metaheuristic approach for the vertex coloring problem
- A procedure for the strategic planning of locations, capacities and districting of jails: application to Chile
- An adaptive memory algorithm for the \(k\)-coloring problem
- Analysis and control of Boolean networks. A semi-tensor product approach.
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Consentability and protocol design of multi-agent systems with stochastic switching topology
- Controllability and observability of Boolean control networks
- Controllability of Boolean control networks with time delays in states
- Flocking for Multi-Agent Dynamic Systems: Algorithms and Theory
- Flocking of Multi-Agents With a Virtual Leader
- Graph coloring for air traffic flow management
- Group consensus in multi-agent systems with switching topologies and communication delays
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Information Flow and Cooperative Control of Vehicle Formations
- Mean square average-consensus under measurement noises and fixed topologies: necessary and sufficient conditions
- Necessary and sufficient graphical conditions for formation control of unicycles
- On maximal independent sets of vertices in claw-free graphs
- On the general consensus protocol of multi-agent systems with double-integrator dynamics
- Realization of Boolean control networks
- Stability and stabilization of Boolean networks
- Stable Flocking of Multiple Inertial Agents on Balanced Graphs
- Synchronization of multi-agent systems without connectivity assumptions
- The maximum clique problem
- The robust coloring problem.
- Variable space search for graph coloring
Cited in
(51)- An algebraic expression of finite horizon optimal control algorithm for stochastic logical dynamical systems
- Complete synchronization of temporal Boolean networks
- Simultaneous stabilization for a set of Boolean control networks
- Robust graph coloring based on the matrix semi-tensor product with application to examination timetabling
- Solving type-2 fuzzy relation equations via semi-tensor product of matrices
- Weighted and near weighted potential games with application to game theoretic control
- Stability and stabilization of a class of finite evolutionary games
- \(L(p,q)\)-label coloring problem with application to channel allocation
- Matrix expression and vaccination control for epidemic dynamics over dynamic networks
- Matrix formulation of EISs of graphs and its application to WSN covering problems
- Topological and graph-coloring conditions on the parameter-independent stability of second-order networked systems
- Synchronization of coupled large-scale Boolean networks
- On solutions of the matrix equation \(AX=B\) with respect to semi-tensor product
- A matrix approach to the analysis and control of networked evolutionary games with bankruptcy mechanism
- Function perturbations in Boolean networks with its application in a \textit{D. melanogaster} gene network
- Minimum-time state feedback stabilization of constrained Boolean control networks
- Lyapunov-based stability and construction of Lyapunov functions for Boolean networks
- Set stability and set stabilization of Boolean control networks based on invariant subsets
- Stability and stabilization of evolutionary games with time delays via matrix method
- Dynamics and control of singular Boolean networks
- Matching algorithms of minimum input selection for structural controllability based on semi-tensor product of matrices
- General decomposition of fuzzy relations: semi-tensor product approach
- Two kinds of optimal controls for probabilistic mix-valued logical dynamic networks
- Cluster synchronization of a class of multi-agent systems with a bipartite graph topology
- Topologies on quotient space of matrices via semi‐tensor product
- Semi-tensor product of matrices approach to reachability of finite automata with application to language recognition
- On finite potential games
- On couple-group consensus of multiagent networks with communication and input time delays
- Matrix expression of finite Boolean-type algebras
- 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
- Indirect unstructured hex-dominant mesh generation using tetrahedra recombination
- STP Approach to Model Controlled Automata with Application to Reachability Analysis of DEDS
- Algebraic state space approach to model and control combined automata
- Matrix approach to formulate and search \(k\)-ESS of graphs using the STP theory
- Stability analysis of state-triggered impulsive Boolean networks based on a hybrid index model
- Mean-square stability of discrete-time switched systems under modeled random switching
- A matrix approach to hypergraph stable set and coloring problems with its application to storing problem
- 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
- Minimum energy control and optimal-satisfactory control of Boolean control network
- Group consensus control for heterogeneous multi-agent systems with fixed and switching topologies
- 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
- Solvability of \(k\)-track assignment problem: a graph approach
- Nonsingularity of feedback shift registers
- 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
- A semi-tensor product approach to networked evolutionary games
- Controllability of context-sensitive probabilistic mix-valued logical control networks with constraints
- Algebraic verification of finite group-based potential games with vector payoffs
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)
