{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:14:42Z","timestamp":1750306482068,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,9,28]],"date-time":"2015-09-28T00:00:00Z","timestamp":1443398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,9,28]]},"DOI":"10.1145\/2815782.2815825","type":"proceedings-article","created":{"date-parts":[[2015,12,18]],"date-time":"2015-12-18T14:32:43Z","timestamp":1450449163000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Enlarging Directed Graphs To Ensure All Nodes Are Contained In Cycles"],"prefix":"10.1145","author":[{"given":"J. J.","family":"van der Linde","sequence":"first","affiliation":[{"name":"School of Computing, University of South Africa, UNISA Science Campus, Florida"}]},{"given":"I. D.","family":"Sanders","sequence":"additional","affiliation":[{"name":"School of Computing, University of South Africa, UNISA Science Campus, Florida"}]}],"member":"320","published-online":{"date-parts":[[2015,9,28]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"G. Chartrand L. Lesniak and P. Zhang. Graphs and Digraphs. Chapman and Hall\/CRC Press Boca Raton Florida 5th edition 2011.  G. Chartrand L. Lesniak and P. Zhang. Graphs and Digraphs. Chapman and Hall\/CRC Press Boca Raton Florida 5th edition 2011.","DOI":"10.1201\/b14892"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1688345.1688872"},{"volume-title":"IBM Thomas J. Watson Research Division","year":"1973","author":"Eswaran K.","key":"e_1_3_2_1_3_1"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/0205044"},{"key":"e_1_3_2_1_5_1","unstructured":"S. Even. Graph Algorithms. Cambridge University Press New York NY USA 2nd edition 2011.   S. Even. Graph Algorithms. Cambridge University Press New York NY USA 2nd edition 2011."},{"key":"e_1_3_2_1_6_1","unstructured":"J. B. Fraleigh. A First Course In Abstract Algebra. Pearson Education Inc. 7th edition 2003.  J. B. Fraleigh. A First Course In Abstract Algebra. Pearson Education Inc. 7th edition 2003."},{"issue":"4","key":"e_1_3_2_1_7_1","first-page":"486","article-title":"Connectivity considerations in the design of survivable networks. Circuit Theory","volume":"17","author":"Frank H.","year":"1970","journal-title":"IEEE Transactions on"},{"key":"e_1_3_2_1_8_1","first-page":"57","volume-title":"Proceedings of the Advanced International Conference on Telecommunications and International Conference on Internet and Web Applications and Services, AICT-ICIW '06","author":"Liu H.","year":"2006"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"J. J. Rotman. Graduate Texts in Mathematics: An Introduction to the Theory of Groups. Springer 4th edition 1994.  J. J. Rotman. Graduate Texts in Mathematics: An Introduction to the Theory of Groups. Springer 4th edition 1994.","DOI":"10.1007\/978-1-4612-4176-8"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2513456.2517086"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/0222056"},{"volume-title":"USA","year":"1972","author":"Tarjan R. E.","key":"e_1_3_2_1_12_1"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/362814.362819"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.75.046117"}],"event":{"name":"SAICSIT '15: The 2015 Annual Research Conference of the South African Institute of Computer Scientists and Information Technologists","acronym":"SAICSIT '15","location":"Stellenbosch South Africa"},"container-title":["Proceedings of the 2015 Annual Research Conference on South African Institute of Computer Scientists and Information Technologists"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2815782.2815825","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2815782.2815825","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:48:23Z","timestamp":1750225703000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2815782.2815825"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,28]]},"references-count":14,"alternative-id":["10.1145\/2815782.2815825","10.1145\/2815782"],"URL":"https:\/\/doi.org\/10.1145\/2815782.2815825","relation":{},"subject":[],"published":{"date-parts":[[2015,9,28]]},"assertion":[{"value":"2015-09-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}