有向图上掷片博弈的g -强正脚本和临界构型

2016 International Conference on Advanced Computing and Applications (ACOMP) Pub Date : 2014-12-03 DOI:10.1109/ACOMP.2016.030

Tran Thi Thu Huong

{"title":"有向图上掷片博弈的g -强正脚本和临界构型","authors":"Tran Thi Thu Huong","doi":"10.1109/ACOMP.2016.030","DOIUrl":null,"url":null,"abstract":"We show a collection of scripts, called G-strongly positive scripts, which is used to recognize critical configurations of a CFG (chip firing game) on a multi-digraph with a global sink. Moreover, an algorithm for finding the minimum G-strongly positive script is also given. From that we generalize a very recent result by Aval et.al which prove the non-stableness of configurations obtained from a critical configuration by firing inversely any non-empty multi-subset of vertices for digraphs.","PeriodicalId":133451,"journal":{"name":"2016 International Conference on Advanced Computing and Applications (ACOMP)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"G-Strongly Positive Scripts and Critical Configurations of Chip Firing Games on Digraphs\",\"authors\":\"Tran Thi Thu Huong\",\"doi\":\"10.1109/ACOMP.2016.030\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We show a collection of scripts, called G-strongly positive scripts, which is used to recognize critical configurations of a CFG (chip firing game) on a multi-digraph with a global sink. Moreover, an algorithm for finding the minimum G-strongly positive script is also given. From that we generalize a very recent result by Aval et.al which prove the non-stableness of configurations obtained from a critical configuration by firing inversely any non-empty multi-subset of vertices for digraphs.\",\"PeriodicalId\":133451,\"journal\":{\"name\":\"2016 International Conference on Advanced Computing and Applications (ACOMP)\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 International Conference on Advanced Computing and Applications (ACOMP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACOMP.2016.030\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 International Conference on Advanced Computing and Applications (ACOMP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACOMP.2016.030","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

我们展示了一组脚本，称为g强正脚本，用于识别具有全局接收器的多有向图上CFG(芯片发射游戏)的关键配置。此外，还给出了求最小g强正谱的算法。在此基础上，我们推广了Aval等人最近的一个结果，该结果证明了由有向图的任意非空顶点的多子集逆发射而得到的临界构型的非稳定性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

G-Strongly Positive Scripts and Critical Configurations of Chip Firing Games on Digraphs

We show a collection of scripts, called G-strongly positive scripts, which is used to recognize critical configurations of a CFG (chip firing game) on a multi-digraph with a global sink. Moreover, an algorithm for finding the minimum G-strongly positive script is also given. From that we generalize a very recent result by Aval et.al which prove the non-stableness of configurations obtained from a critical configuration by firing inversely any non-empty multi-subset of vertices for digraphs.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2016 International Conference on Advanced Computing and Applications (ACOMP)

自引率

0.00%

发文量