{"id":"https://openalex.org/W7201866317","doi":"https://doi.org/10.5753/jbcs.2026.7462","title":"Impartial Games on Graphs: Solving Kayles via Dynamic Programming and Periodicity Properties","display_name":"Impartial Games on Graphs: Solving Kayles via Dynamic Programming and Periodicity Properties","publication_year":2026,"publication_date":"2026-07-31","ids":{"openalex":"https://openalex.org/W7201866317","doi":"https://doi.org/10.5753/jbcs.2026.7462"},"language":null,"primary_location":{"id":"doi:10.5753/jbcs.2026.7462","is_oa":true,"landing_page_url":"https://doi.org/10.5753/jbcs.2026.7462","pdf_url":"https://journals-sol.sbc.org.br/index.php/jbcs/article/download/7462/4204","source":{"id":"https://openalex.org/S69801987","display_name":"Journal of the Brazilian Computer Society","issn_l":"0104-6500","issn":["0104-6500","1678-4804"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Brazilian Computer Society","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://journals-sol.sbc.org.br/index.php/jbcs/article/download/7462/4204","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5145936194","display_name":"Marcos Felipe Medeiros-de-Souza","orcid":"https://orcid.org/0000-0002-2844-5031"},"institutions":[{"id":"https://openalex.org/I3018965473","display_name":"Instituto Federal Fluminense","ror":"https://ror.org/0009eqg37","country_code":"BR","type":"education","lineage":["https://openalex.org/I3018965473"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Marcos Felipe Medeiros-de-Souza","raw_affiliation_strings":["Fluminense Federal Institute"],"raw_orcid":"https://orcid.org/0000-0002-2844-5031","affiliations":[{"raw_affiliation_string":"Fluminense Federal Institute","institution_ids":["https://openalex.org/I3018965473"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5146038972","display_name":"Felipe Eizo Hanada","orcid":"https://orcid.org/0009-0002-6996-2438"},"institutions":[{"id":"https://openalex.org/I161127581","display_name":"Universidade Federal Fluminense","ror":"https://ror.org/02rjhbb08","country_code":"BR","type":"education","lineage":["https://openalex.org/I161127581"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Felipe Eizo Hanada","raw_affiliation_strings":["Fluminense Federal University"],"raw_orcid":"https://orcid.org/0009-0002-6996-2438","affiliations":[{"raw_affiliation_string":"Fluminense Federal University","institution_ids":["https://openalex.org/I161127581"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072390886","display_name":"F\u00e1bio Protti","orcid":"https://orcid.org/0000-0001-9924-0079"},"institutions":[{"id":"https://openalex.org/I161127581","display_name":"Universidade Federal Fluminense","ror":"https://ror.org/02rjhbb08","country_code":"BR","type":"education","lineage":["https://openalex.org/I161127581"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"F\u00e1bio Protti","raw_affiliation_strings":["Fluminense Federal University"],"raw_orcid":"https://orcid.org/0000-0001-9924-0079","affiliations":[{"raw_affiliation_string":"Fluminense Federal University","institution_ids":["https://openalex.org/I161127581"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":1390,"currency":"USD","value_usd":1390},"apc_paid":{"value":1390,"currency":"USD","value_usd":1390},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.91976905,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":"32","issue":"1","first_page":"1951","last_page":"1960"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.3605000078678131,"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.3605000078678131,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.1370999962091446,"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/T10142","display_name":"Formal Methods in Verification","score":0.120899997651577,"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/vertex","display_name":"Vertex (graph theory)","score":0.5940999984741211},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.5435000061988831},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5327000021934509},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5217999815940857},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.46000000834465027},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.3871999979019165},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.3856000006198883}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5940999984741211},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.5435000061988831},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5327000021934509},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5217999815940857},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48339998722076416},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.46000000834465027},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4521999955177307},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43799999356269836},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41290000081062317},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.3871999979019165},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.3856000006198883},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.3779999911785126},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.373199999332428},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.37220001220703125},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.34360000491142273},{"id":"https://openalex.org/C102234262","wikidata":"https://www.wikidata.org/wiki/Q1320931","display_name":"Combinatorial game theory","level":4,"score":0.33250001072883606},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3257000148296356},{"id":"https://openalex.org/C73795354","wikidata":"https://www.wikidata.org/wiki/Q287618","display_name":"Sequential game","level":3,"score":0.30070000886917114},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.2985000014305115},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.26339998841285706}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.5753/jbcs.2026.7462","is_oa":true,"landing_page_url":"https://doi.org/10.5753/jbcs.2026.7462","pdf_url":"https://journals-sol.sbc.org.br/index.php/jbcs/article/download/7462/4204","source":{"id":"https://openalex.org/S69801987","display_name":"Journal of the Brazilian Computer Society","issn_l":"0104-6500","issn":["0104-6500","1678-4804"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Brazilian Computer Society","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.5753/jbcs.2026.7462","is_oa":true,"landing_page_url":"https://doi.org/10.5753/jbcs.2026.7462","pdf_url":"https://journals-sol.sbc.org.br/index.php/jbcs/article/download/7462/4204","source":{"id":"https://openalex.org/S69801987","display_name":"Journal of the Brazilian Computer Society","issn_l":"0104-6500","issn":["0104-6500","1678-4804"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Brazilian Computer Society","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.5508005619049072,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320322025","display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","ror":"https://ror.org/03swz6y49"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7201866317.pdf","grobid_xml":"https://content.openalex.org/works/W7201866317.grobid-xml"},"referenced_works_count":11,"referenced_works":["https://openalex.org/W1808773692","https://openalex.org/W1970560697","https://openalex.org/W1999263269","https://openalex.org/W2026121858","https://openalex.org/W2042714866","https://openalex.org/W2163724992","https://openalex.org/W2330301979","https://openalex.org/W2894564506","https://openalex.org/W2914858890","https://openalex.org/W2947640210","https://openalex.org/W4247908066"],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1,72,105,119,144,160,314],"work,":[2],"we":[3,25,155,216,276,311],"consider":[4,127],"combinatorial":[5],"games":[6],"in":[7,34,71,158,174,224,272,296,335],"which":[8,35,112,159],"two":[9],"players":[10,77],"alternately":[11],"choose":[12],"vertices":[13,38],"from":[14,205],"a":[15,19,59,63,79,83,89,97,115,219,238,245,249],"finite":[16],"graph":[17,145],"until":[18],"winning":[20,80,116],"condition":[21,247],"is":[22,147,189],"achieved.":[23],"Specifically,":[24],"focus":[26],"our":[27],"investigation":[28],"on":[29,130,143,286,324],"the":[30,36,45,49,55,76,93,99,123,170,184,192,206,229,267,292,330],"well-known":[31],"game":[32,108],"Kayles,":[33],"selected":[37],"must":[39],"form":[40],"an":[41,137,195,278,303],"independent":[42,65],"set,":[43],"and":[44,151,176,264,298,337],"player":[46,56,113],"who":[47,57],"makes":[48],"last":[50],"valid":[51],"move":[52],"wins":[53],"(i.e.,":[54],"chooses":[58],"vertex":[60],"that":[61,87,183,218],"completes":[62],"maximal":[64],"set).":[66],"Zermelo's":[67],"Theorem":[68],"guarantees":[69],"that,":[70],"scenario,":[73],"one":[74],"of":[75,85,92,107,110,186,194,221,231,241,251,269,288,306,326],"has":[78,114],"strategy---that":[81],"is,":[82],"sequence":[84],"moves":[86],"ensures":[88],"win":[90],"regardless":[91],"opponent's":[94],"choices.":[95],"Given":[96],"graph,":[98],"typical":[100],"decision":[101],"problem":[102],"associated":[103],"with":[104,237,302],"type":[106],"consists":[109],"determining":[111],"strategy.":[117],"Answering":[118],"question":[120],"means":[121],"solving":[122,141,284],"game.":[124],"We":[125,181,243],"first":[126],"Kayles":[128,142,285,323],"played":[129],"caterpillars.":[131,180],"Since":[132],"caterpillars":[133,213,252,271],"are":[134],"interval":[135],"graphs,":[136],"O(n3)-time":[138,331],"algorithm":[139,282,317],"for":[140,248,283,340],"class":[146,250],"already":[148],"known":[149],"[Bodlaender":[150,297,336],"Kratsch,":[152,299,338],"2002].":[153],"However,":[154],"investigate":[156],"scenarios":[157],"time":[161],"complexity":[162,294,332],"can":[163,318],"be":[164,319],"reduced":[165,197,212],"to":[166,179,191,233,235,253,259,265,321],"O(1)":[167,273],"by":[168,200],"extending":[169],"periodicity":[171,255],"property":[172],"presented":[173],"[Guignard":[175],"Sopena,":[177],"2009]":[178],"prove":[182],"nimber":[185,193,268],"any":[187],"caterpillar":[188],"equal":[190],"equivalent":[196],"caterpillar,":[198],"obtained":[199],"appropriately":[201],"removing":[202],"certain":[203],"leaves":[204],"original":[207],"graph.":[208],"By":[209],"partitioning":[210],"these":[211],"into":[214],"classes,":[215],"show":[217,312],"period":[220],"34":[222],"emerges":[223],"each":[225],"investigated":[226],"class,":[227],"allowing":[228],"computation":[230],"nimbers":[232],"scale":[234],"graphs":[236,301],"large":[239],"number":[240,305],"vertices.":[242],"present":[244,277],"sufficient":[246],"exhibit":[254],"34,":[256],"using":[257],"it":[258],"identify":[260],"many":[261],"periodic":[262],"classes":[263],"calculate":[266],"their":[270],"time.":[274],"Furthermore,":[275],"O(n2)-time":[279,316],"dynamic":[280],"programming":[281],"powers":[287,325],"paths,":[289],"improving":[290],"upon":[291],"O(n4)-time":[293],"given":[295],"2002]for":[300],"asteroidal":[304],"at":[307],"most":[308],"2.":[309],"Finally,":[310],"how":[313],"same":[315],"adapted":[320],"solve":[322],"cycles,":[327],"thereby":[328],"reducing":[329],"previously":[333],"established":[334],"2002]":[339],"circular-arc":[341],"graphs.":[342]},"counts_by_year":[],"updated_date":"2026-08-09T07:27:16.801131","created_date":"2026-08-08T00:00:00"}