A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems (Q445938): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 93A14 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 93B25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 94C15 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6072686 / rank
 
Normal rank
Property / zbMATH Keywords
 
graph
Property / zbMATH Keywords: graph / rank
 
Normal rank
Property / zbMATH Keywords
 
maximum (weight) stable set
Property / zbMATH Keywords: maximum (weight) stable set / rank
 
Normal rank
Property / zbMATH Keywords
 
vertex coloring
Property / zbMATH Keywords: vertex coloring / rank
 
Normal rank
Property / zbMATH Keywords
 
necessary and sufficient condition
Property / zbMATH Keywords: necessary and sufficient condition / rank
 
Normal rank
Property / zbMATH Keywords
 
algorithm
Property / zbMATH Keywords: algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
multi-agent system
Property / zbMATH Keywords: multi-agent system / rank
 
Normal rank
Property / zbMATH Keywords
 
group consensus
Property / zbMATH Keywords: group consensus / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.automatica.2012.03.024 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2020196141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph coloring for air traffic flow management / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph coloring heuristic using partial solutions and a reactive tabu scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realization of Boolean control networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Representation of Dynamics of Boolean Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Controllability and observability of Boolean control networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis and control of Boolean networks. A semi-tensor product approach. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability and stabilization of Boolean networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Flow and Cooperative Control of Vehicle Formations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive memory algorithm for the \(k\)-coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A procedure for the strategic planning of locations, capacities and districting of jails: application to Chile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable space search for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Maximum Principle for Single-Input Boolean Control Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable Flocking of Multiple Inertial Agents on Balanced Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary and sufficient graphical conditions for formation control of unicycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Controllability of Boolean control networks with time delays in states / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronization of multi-agent systems without connectivity assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mean square average-consensus under measurement noises and fixed topologies: necessary and sufficient conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Metaheuristic Approach for the Vertex Coloring Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal independent sets of vertices in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flocking for Multi-Agent Dynamic Systems: Algorithms and Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consensus Problems in Networks of Agents With Switching Topology and Time-Delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flocking of Multi-Agents With a Virtual Leader / rank
 
Normal rank
Property / cites work
 
Property / cites work: The robust coloring problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group consensus in multi-agent systems with switching topologies and communication delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consentability and protocol design of multi-agent systems with stochastic switching topology / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the general consensus protocol of multi-agent systems with double-integrator dynamics / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 14:12, 5 July 2024

scientific article
Language Label Description Also known as
English
A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems
scientific article

    Statements

    A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 August 2012
    0 references
    graph
    0 references
    maximum (weight) stable set
    0 references
    vertex coloring
    0 references
    necessary and sufficient condition
    0 references
    algorithm
    0 references
    multi-agent system
    0 references
    group consensus
    0 references
    0 references
    0 references

    Identifiers