A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems
- Author
- YUZHEN WANG1 ; CHENGHUI ZHANG1 ; ZHENBIN LIU1
[1] School of Control Science and Engineering, Shandong University, Jinan 250061, China - Source
Automatica (Oxford). 2012, Vol 48, Num 7, pp 1227-1236, 10 p ; ref : 3/4 p
- CODEN
- ATCAA9
- ISSN
- 0005-1098
- Scientific domain
- Control theory, operational research; Computer science
- Publisher
- Elsevier, Kidlington
- Publication country
- United Kingdom
- Document type
- Article
- Language
- English
- Author keyword
- Algorithm Graph Group consensus Maximum (weight) stable set Multi-agent system Necessary and sufficient condition Vertex coloring
- Keyword (fr)
- Calcul tensoriel Coloration graphe Condition nécessaire suffisante Consensus Ensemble indépendant Fonction logique Fonction matricielle Graphe indépendant Intelligence artificielle Méthode tensorielle Produit matrice Produit tensoriel Sommet graphe Système multiagent Système réparti Théorie graphe
- Keyword (en)
- Tensor calculus Graph colouring Necessary and sufficient condition Consensus Independent set Logical function Matrix function Independent graph Artificial intelligence Tensor method Matrix product Tensor product Vertex(graph) Multiagent system Distributed system Graph theory
- Keyword (es)
- Cálculo tensorial Coloración grafo Condición necesaria suficiente Consenso Conjunto independiente Función lógica Función matricial Grafo independiente Inteligencia artificial Método tensorial Producto matriz Producto tensorial Vértice grafo Sistema multiagente Sistema repartido Teoría grafo
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A06 Information retrieval. Graph
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02B Software / 001D02B04 Computer systems and distributed systems. User interface
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02C Artificial intelligence
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02D Control theory. Systems / 001D02D06 Control system analysis
- Discipline
- Computer science : theoretical automation and systems
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 26128537
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Access to the document
Install on your browser
DOI
10.1016/j.automatica.2012.03.024 
https://dx.doi.org/10.1016/j.automatica.2012.03.024
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:32:\"10.1016\/j.automatica.2012.03.024\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:107:\"A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems\";s:9:\"\u0000*\u0000jtitle\";s:19:\"Automatica (Oxford)\";s:9:\"\u0000*\u0000stitle\";s:17:\"Automatica (Oxf.)\";s:7:\"\u0000*\u0000date\";s:4:\"2012\";s:9:\"\u0000*\u0000volume\";s:2:\"48\";s:8:\"\u0000*\u0000issue\";s:1:\"7\";s:8:\"\u0000*\u0000spage\";s:4:\"1227\";s:8:\"\u0000*\u0000epage\";s:4:\"1236\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0005-1098\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:11:\"YUZHEN WANG\";s:10:\"\u0000*\u0000aufirst\";s:0:\"\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:14:\"CHENGHUI ZHANG\";i:1;s:11:\"ZHENBIN LIU\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"ATCAA9\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:107:\"A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems\";s:8:\"\u0000*\u0000place\";s:10:\"Kidlington\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"10\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:32:\"10.1016\/j.automatica.2012.03.024\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:107:\"A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems\";s:9:\"\u0000*\u0000jtitle\";s:19:\"Automatica (Oxford)\";s:9:\"\u0000*\u0000stitle\";s:17:\"Automatica (Oxf.)\";s:7:\"\u0000*\u0000date\";s:4:\"2012\";s:9:\"\u0000*\u0000volume\";s:2:\"48\";s:8:\"\u0000*\u0000issue\";s:1:\"7\";s:8:\"\u0000*\u0000spage\";s:4:\"1227\";s:8:\"\u0000*\u0000epage\";s:4:\"1236\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0005-1098\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:11:\"YUZHEN WANG\";s:10:\"\u0000*\u0000aufirst\";s:0:\"\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:14:\"CHENGHUI ZHANG\";i:1;s:11:\"ZHENBIN LIU\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"ATCAA9\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:107:\"A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems\";s:8:\"\u0000*\u0000place\";s:10:\"Kidlington\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"10\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:32:\"10.1016\/j.automatica.2012.03.024\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:32:\"10.1016\/j.automatica.2012.03.024\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:107:\"A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems\";s:9:\"\u0000*\u0000jtitle\";s:19:\"Automatica (Oxford)\";s:9:\"\u0000*\u0000stitle\";s:17:\"Automatica (Oxf.)\";s:7:\"\u0000*\u0000date\";s:4:\"2012\";s:9:\"\u0000*\u0000volume\";s:2:\"48\";s:8:\"\u0000*\u0000issue\";s:1:\"7\";s:8:\"\u0000*\u0000spage\";s:4:\"1227\";s:8:\"\u0000*\u0000epage\";s:4:\"1236\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0005-1098\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:11:\"YUZHEN WANG\";s:10:\"\u0000*\u0000aufirst\";s:0:\"\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:14:\"CHENGHUI ZHANG\";i:1;s:11:\"ZHENBIN LIU\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"ATCAA9\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:107:\"A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems\";s:8:\"\u0000*\u0000place\";s:10:\"Kidlington\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"10\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:32:\"10.1016\/j.automatica.2012.03.024\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:107:\"A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems\";s:9:\"\u0000*\u0000jtitle\";s:19:\"Automatica (Oxford)\";s:9:\"\u0000*\u0000stitle\";s:17:\"Automatica (Oxf.)\";s:7:\"\u0000*\u0000date\";s:4:\"2012\";s:9:\"\u0000*\u0000volume\";s:2:\"48\";s:8:\"\u0000*\u0000issue\";s:1:\"7\";s:8:\"\u0000*\u0000spage\";s:4:\"1227\";s:8:\"\u0000*\u0000epage\";s:4:\"1236\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0005-1098\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:11:\"YUZHEN WANG\";s:10:\"\u0000*\u0000aufirst\";s:0:\"\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:14:\"CHENGHUI ZHANG\";i:1;s:11:\"ZHENBIN LIU\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"ATCAA9\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:107:\"A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems\";s:8:\"\u0000*\u0000place\";s:10:\"Kidlington\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"10\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
