{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:28:25Z","timestamp":1750220905067,"version":"3.41.0"},"publisher-location":"New York, New York, USA","reference-count":13,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1145\/3368926.3369674","type":"proceedings-article","created":{"date-parts":[[2019,12,20]],"date-time":"2019-12-20T13:30:11Z","timestamp":1576848611000},"page":"178-185","source":"Crossref","is-referenced-by-count":0,"title":["Minimum Graph Partition with Basis"],"prefix":"10.1145","author":[{"given":"B\u00f9i Quang","family":"Minh","sequence":"first","affiliation":[{"name":"Universit\u00e9 de Montr\u00e9al, Department of Computer Science and Operations Research, Montr\u00e9al, QC, Canada"}]},{"given":"Michel","family":"Toulouse","sequence":"additional","affiliation":[{"name":"Vietnamese-German University, Department of Computer Science, Binh Duong New City, Vietnam"}]}],"member":"320","reference":[{"key":"key-10.1145\/3368926.3369674-1","doi-asserted-by":"crossref","unstructured":"Dzulkifli S. Scherber and Haralabos C. Papadopoulos. Locally constructed algorithms for distributed computations in ad-hoc networks. In Proceedings of the 3rd International Symposium on Information Processing in Sensor Networks, IPSN'04, pages 11--19, New York, NY, USA, 2004. ACM. ISBN 1-58113-846-6. doi: https:\/\/doi.org\/10.1145\/984622.984625.","DOI":"10.1145\/984622.984625"},{"key":"key-10.1145\/3368926.3369674-2","doi-asserted-by":"crossref","unstructured":"Lin Xiao, Stephen Boyd, and Seung-Jean Kim. Distributed average consensus with least-mean-square deviation. Journal of Parallel and Distributed Computing, 67(1):33 -- 46, 2007. ISSN 0743-7315. doi: https:\/\/doi.org\/10.1016\/j.jpdc.2006.08.010. URL http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0743731506001808.","DOI":"10.1016\/j.jpdc.2006.08.010"},{"key":"key-10.1145\/3368926.3369674-3","doi-asserted-by":"crossref","unstructured":"L. Xiao, S. Boyd, and S. Lall. A scheme for robust distributed sensor fusion based on average consensus. In IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005., pages 63--70, April 2005. doi: https:\/\/doi.org\/10.1109\/IPSN.2005.1440896.","DOI":"10.1109\/IPSN.2005.1440896"},{"key":"key-10.1145\/3368926.3369674-4","doi-asserted-by":"crossref","unstructured":"R. O. Saber and R. M. Murray. Consensus protocols for networks of dynamic agents. In Proceedings of the 2003 American Control Conference, 2003., volume 2, pages 951--956, June 2003. doi: https:\/\/doi.org\/10.1109\/ACC.2003.1239709.","DOI":"10.1109\/ACC.2003.1239709"},{"key":"key-10.1145\/3368926.3369674-5","doi-asserted-by":"crossref","unstructured":"Ke Peng and Yupu Yang. Leader-following consensus problem with a varying-velocity leader and time-varying delays. Physica A: Statistical Mechanics and its Applications, 388(2):193 -- 208, 2009. ISSN 0378-4371. doi: https:\/\/doi.org\/10.1016\/j.physa.2008.10.009. URL http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0378437108008261.","DOI":"10.1016\/j.physa.2008.10.009"},{"key":"key-10.1145\/3368926.3369674-6","doi-asserted-by":"crossref","unstructured":"J. Tsitsiklis, D. Bertsekas, and M. Athans. Distributed asynchronous deterministic and stochastic gradient optimization algorithms. IEEE Transactions on Automatic Control, 31(9):803--812, Sep. 1986. ISSN 0018-9286. doi: https:\/\/doi.org\/10.1109\/TAC.1986.1104412.","DOI":"10.1109\/TAC.1986.1104412"},{"key":"key-10.1145\/3368926.3369674-7","doi-asserted-by":"crossref","unstructured":"S. Sundaram and C. N. Hadjicostis. Distributed function calculation and consensus using linear iterative strategies. IEEE Journal on Selected Areas in Communications, 26(4):650--660, May 2008. ISSN 0733-8716. doi: https:\/\/doi.org\/10.1109\/JSAC.2008.080507.","DOI":"10.1109\/JSAC.2008.080507"},{"key":"key-10.1145\/3368926.3369674-8","doi-asserted-by":"crossref","unstructured":"S. Sundaram and C. N. Hadjicostis. Structural controllability and observability of linear systems over finite fields with applications to multi-agent systems. IEEE Transactions on Automatic Control, 58(1):60--73, Jan 2013. ISSN 0018-9286. doi: https:\/\/doi.org\/10.1109\/TAC.2012.2204155.","DOI":"10.1109\/TAC.2012.2204155"},{"key":"key-10.1145\/3368926.3369674-9","doi-asserted-by":"crossref","unstructured":"Michel Toulouse and Bùi Quang Minh. Applicability and resilience of a linear encoding scheme for computing consensus. In Proceedings of the 3rd International Conference on Internet of Things, Big Data and Security - Volume 1: IoTBDS, pages 173--184. INSTICC, SciTePress, 2018. ISBN 978-989-758-296-7. doi: https:\/\/doi.org\/10.5220\/0006806001730184.","DOI":"10.5220\/0006806001730184"},{"key":"key-10.1145\/3368926.3369674-10","doi-asserted-by":"crossref","unstructured":"Michel Toulouse, Bùi Quang Minh, and Quang Tran Minh. Transactions on Large-Scale Data and Knowledge-Centered Systems XLI: Special Issue on Data and Security Engineering, chapter Invariant Properties and Bounds on a Finite Time Consensus Algorithm, pages 32--58. Springer Berlin Heidelberg, Berlin, Heidelberg, 2019. ISBN 978-3-662-58808-6. doi: https:\/\/doi.org\/10.1007\/978-3-662-58808-6_2.","DOI":"10.1007\/978-3-662-58808-6_2"},{"key":"key-10.1145\/3368926.3369674-11","doi-asserted-by":"crossref","unstructured":"Andreas Emil Feldmann. Fast balanced partitioning is hard even on grids and trees. Theoretical Computer Science, 485:61 -- 68, 2013. ISSN 0304-3975. doi: https:\/\/doi.org\/10.1016\/j.tcs.2013.03.014. URL http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397513002259.","DOI":"10.1016\/j.tcs.2013.03.014"},{"key":"key-10.1145\/3368926.3369674-12","doi-asserted-by":"crossref","unstructured":"George L. Nemhauser and Laurence A. Wolsey. Integer and Combinatorial Optimization. Wiley-Interscience, New York, NY, USA, 1988. ISBN 0-471-82819-X. doi: https:\/\/doi.org\/10.1002\/9781118627372.","DOI":"10.1002\/9781118627372"},{"key":"key-10.1145\/3368926.3369674-13","doi-asserted-by":"crossref","unstructured":"Elizabeth D. Dolan and Jorge J. Moré. Benchmarking optimization software with performance profiles. Mathematical Programming, 91(2):201--213, Jan 2002. ISSN 1436-4646. doi: https:\/\/doi.org\/10.1007\/s101070100263.","DOI":"10.1007\/s101070100263"}],"event":{"number":"10","sponsor":["SOICT, School of Information and Communication Technology - HUST","NAFOSTED, The National Foundation for Science and Technology Development"],"acronym":"SoICT 2019","name":"the Tenth International Symposium","start":{"date-parts":[[2019,12,4]]},"location":"Hanoi, Ha Long Bay, Viet Nam","end":{"date-parts":[[2019,12,6]]}},"container-title":["Proceedings of the Tenth International Symposium on Information and Communication Technology  - SoICT 2019"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3368926.3369674","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=3369674&ftid=2101256&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:44:51Z","timestamp":1750203891000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=3368926.3369674"}},"subtitle":[],"proceedings-subject":"Information and Communication Technology","short-title":[],"issued":{"date-parts":[[2019]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1145\/3368926.3369674","relation":{},"subject":[],"published":{"date-parts":[[2019]]}}}