{"id":"https://openalex.org/W2750775753","doi":"https://doi.org/10.1145/3102071.3110575","title":"On using graph partitioning with isomorphism constraint in procedural content generation","display_name":"On using graph partitioning with isomorphism constraint in procedural content generation","publication_year":2017,"publication_date":"2017-08-14","ids":{"openalex":"https://openalex.org/W2750775753","doi":"https://doi.org/10.1145/3102071.3110575","mag":"2750775753"},"language":"en","primary_location":{"id":"doi:10.1145/3102071.3110575","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3102071.3110575","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th International Conference on the Foundations of Digital Games","raw_type":"proceedings-article"},"type":"conference-paper","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/A5056965501","display_name":"Ahmed M. Abuzuraiq","orcid":"https://orcid.org/0000-0002-3604-7623"},"institutions":[{"id":"https://openalex.org/I134085113","display_name":"King Fahd University of Petroleum and Minerals","ror":"https://ror.org/03yez3163","country_code":"SA","type":"education","lineage":["https://openalex.org/I134085113"]}],"countries":["SA"],"is_corresponding":true,"raw_author_name":"Ahmed M. Abuzuraiq","raw_affiliation_strings":["King Fahd University of Petroleum & Minerals, Saudi Arabia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"King Fahd University of Petroleum & Minerals, Saudi Arabia","institution_ids":["https://openalex.org/I134085113"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5056965501"],"corresponding_institution_ids":["https://openalex.org/I134085113"],"apc_list":null,"apc_paid":null,"fwci":0.1384,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.42097208,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"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/T11574","display_name":"Artificial Intelligence in Games","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11574","display_name":"Artificial Intelligence in Games","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11197","display_name":"Digital Games and Media","score":0.9848999977111816,"subfield":{"id":"https://openalex.org/subfields/3312","display_name":"Sociology and Political Science"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6169775128364563},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5018868446350098},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4959805905818939},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4829980134963989},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.44757890701293945},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.43010178208351135},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4293452501296997},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.4261315166950226},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.4174363911151886},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3693639636039734},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25319451093673706},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1735641062259674},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14034900069236755}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6169775128364563},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5018868446350098},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4959805905818939},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4829980134963989},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.44757890701293945},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.43010178208351135},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4293452501296997},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.4261315166950226},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.4174363911151886},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3693639636039734},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25319451093673706},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1735641062259674},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14034900069236755},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3102071.3110575","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3102071.3110575","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th International Conference on the Foundations of Digital Games","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.5699999928474426,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W184452495","https://openalex.org/W1591454964","https://openalex.org/W1703742514","https://openalex.org/W1760293109","https://openalex.org/W1774277213","https://openalex.org/W1969483458","https://openalex.org/W2020987898","https://openalex.org/W2032338144","https://openalex.org/W2118953734","https://openalex.org/W2127391575","https://openalex.org/W2147405597","https://openalex.org/W2405739437","https://openalex.org/W2538962136","https://openalex.org/W2540003657","https://openalex.org/W2604565756"],"related_works":["https://openalex.org/W2991205486","https://openalex.org/W2073067110","https://openalex.org/W2905073546","https://openalex.org/W2353396818","https://openalex.org/W3029397302","https://openalex.org/W2370473919","https://openalex.org/W2948967052","https://openalex.org/W2807251790","https://openalex.org/W1983606985","https://openalex.org/W2109056537"],"abstract_inverted_index":{"This":[0],"paper":[1],"describes":[2],"an":[3],"algorithm":[4,31,85,118],"to":[5,54,79,87,100],"solve":[6,58],"the":[7,27,30,40,81,88,114,117,128,131],"problem":[8,60],"of":[9,29,42,46,116,130],"partitioning":[10],"a":[11,15,65,95],"planar":[12],"graph":[13,77],"with":[14,64],"constraint":[16],"on":[17],"which":[18,38],"partitions":[19],"should":[20],"be":[21],"adjacent":[22],"or":[23,50],"nonadjacent.":[24],"We":[25,57],"explore":[26],"applications":[28],"in":[32,36,111,127],"Procedural":[33],"Content":[34],"Generation":[35],"games":[37],"includes:":[39],"generation":[41],"political":[43],"maps,":[44],"distribution":[45],"terrain":[47],"and":[48,71,94,119],"converting":[49],"linking":[51],"Mission":[52],"Graphs":[53],"game":[55],"spaces.":[56],"this":[59],"using":[61],"A-Star":[62],"search":[63,82],"heuristic":[66],"for":[67],"measuring":[68],"graphs":[69],"similarity":[70],"we":[72,104,120],"suggest":[73],"techniques":[74],"such":[75],"as":[76],"coarsening":[78],"limit":[80],"space.":[83],"The":[84],"sensitivity":[86],"initial":[89],"state":[90],"is":[91,98],"analyzed":[92],"next":[93],"restart":[96],"policy":[97],"suggested":[99],"overcome":[101],"that.":[102],"Additionally,":[103],"present":[105],"multiple":[106],"constraints":[107,124],"that":[108],"can":[109,125],"aid":[110],"better":[112],"controlling":[113],"outcomes":[115],"show":[121],"how":[122],"these":[123],"help":[126],"implementation":[129],"displayed":[132],"applications.":[133]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}