{"id":"https://openalex.org/W2256470827","doi":"https://doi.org/10.1145/2815782.2815825","title":"Enlarging Directed Graphs To Ensure All Nodes Are Contained In Cycles","display_name":"Enlarging Directed Graphs To Ensure All Nodes Are Contained In Cycles","publication_year":2015,"publication_date":"2015-09-28","ids":{"openalex":"https://openalex.org/W2256470827","doi":"https://doi.org/10.1145/2815782.2815825","mag":"2256470827"},"language":"en","primary_location":{"id":"doi:10.1145/2815782.2815825","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2815782.2815825","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2015 Annual Research Conference on South African Institute of Computer Scientists and Information Technologists","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075504954","display_name":"J. Linde","orcid":null},"institutions":[{"id":"https://openalex.org/I165390105","display_name":"University of South Africa","ror":"https://ror.org/048cwvf49","country_code":"ZA","type":"education","lineage":["https://openalex.org/I165390105"]}],"countries":["ZA"],"is_corresponding":true,"raw_author_name":"J. J. van der Linde","raw_affiliation_strings":["School of Computing, University of South Africa, UNISA Science Campus, Florida"],"affiliations":[{"raw_affiliation_string":"School of Computing, University of South Africa, UNISA Science Campus, Florida","institution_ids":["https://openalex.org/I165390105"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020352425","display_name":"Ian Sanders","orcid":"https://orcid.org/0000-0001-9081-8145"},"institutions":[{"id":"https://openalex.org/I165390105","display_name":"University of South Africa","ror":"https://ror.org/048cwvf49","country_code":"ZA","type":"education","lineage":["https://openalex.org/I165390105"]}],"countries":["ZA"],"is_corresponding":false,"raw_author_name":"I. D. Sanders","raw_affiliation_strings":["School of Computing, University of South Africa, UNISA Science Campus, Florida"],"affiliations":[{"raw_affiliation_string":"School of Computing, University of South Africa, UNISA Science Campus, Florida","institution_ids":["https://openalex.org/I165390105"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5075504954"],"corresponding_institution_ids":["https://openalex.org/I165390105"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.12781732,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/null-graph","display_name":"Null graph","score":0.5861154794692993},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5797615051269531},{"id":"https://openalex.org/keywords/butterfly-graph","display_name":"Butterfly graph","score":0.5588511228561401},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.5111122727394104},{"id":"https://openalex.org/keywords/graph-property","display_name":"Graph property","score":0.49040818214416504},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.4879598021507263},{"id":"https://openalex.org/keywords/complement-graph","display_name":"Complement graph","score":0.47542718052864075},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4574193060398102},{"id":"https://openalex.org/keywords/strength-of-a-graph","display_name":"Strength of a graph","score":0.428041934967041},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42174625396728516},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3784032464027405},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33986228704452515},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3137258291244507}],"concepts":[{"id":"https://openalex.org/C17169500","wikidata":"https://www.wikidata.org/wiki/Q3033506","display_name":"Null graph","level":5,"score":0.5861154794692993},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5797615051269531},{"id":"https://openalex.org/C18819970","wikidata":"https://www.wikidata.org/wiki/Q3035340","display_name":"Butterfly graph","level":5,"score":0.5588511228561401},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.5111122727394104},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.49040818214416504},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.4879598021507263},{"id":"https://openalex.org/C168291704","wikidata":"https://www.wikidata.org/wiki/Q902252","display_name":"Complement graph","level":5,"score":0.47542718052864075},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4574193060398102},{"id":"https://openalex.org/C19332903","wikidata":"https://www.wikidata.org/wiki/Q7623247","display_name":"Strength of a graph","level":5,"score":0.428041934967041},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42174625396728516},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3784032464027405},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33986228704452515},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3137258291244507}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2815782.2815825","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2815782.2815825","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2015 Annual Research Conference on South African Institute of Computer Scientists and Information Technologists","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.4300000071525574,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1992901072","https://openalex.org/W1998719113","https://openalex.org/W2015645763","https://openalex.org/W2023686130","https://openalex.org/W2085806398","https://openalex.org/W2112450612","https://openalex.org/W2165916781","https://openalex.org/W2281218127","https://openalex.org/W2340365916","https://openalex.org/W2538274664","https://openalex.org/W2796976177","https://openalex.org/W2967057359","https://openalex.org/W4206334169","https://openalex.org/W4230191592","https://openalex.org/W4234462414"],"related_works":["https://openalex.org/W2954009223","https://openalex.org/W2278094798","https://openalex.org/W2900680118","https://openalex.org/W2071056049","https://openalex.org/W1980424184","https://openalex.org/W2108781142","https://openalex.org/W2793949464","https://openalex.org/W3209476063","https://openalex.org/W3100627703","https://openalex.org/W2613377192"],"abstract_inverted_index":{"Many":[0],"algorithms":[1],"in":[2],"graph":[3,29,48,62,72,77],"theory":[4],"add":[5],"or":[6,10],"remove":[7],"either":[8],"edges":[9,26],"nodes":[11,59],"(or":[12],"both)":[13],"to":[14,27,30,46,49],"solve":[15],"a":[16,28,47,51],"given":[17],"problem.":[18],"Graph":[19],"augmentation":[20,73],"typically":[21],"concerns":[22],"the":[23,36,42,58,61],"addition":[24,43],"of":[25,35,44,60],"satisfy":[31,50],"some":[32],"connectivity":[33,53],"property":[34],"graph.":[37],"This":[38],"paper":[39],"focuses":[40],"on":[41],"vertices":[45],"specific":[52],"property:":[54],"ensuring":[55],"that":[56],"all":[57],"are":[63],"contained":[64],"within":[65],"cycles.":[66],"A":[67],"distinction":[68],"is":[69],"made":[70],"between":[71],"(edge":[74],"addition),":[75],"and":[76],"enlargement":[78],"(vertex":[79],"addition).":[80]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}