{"id":"https://openalex.org/W7117688311","doi":"https://doi.org/10.1145/3737611.3776946","title":"A Self-Stabilizing Algorithm for the Maximal Pentagon Partition Problem","display_name":"A Self-Stabilizing Algorithm for the Maximal Pentagon Partition Problem","publication_year":2025,"publication_date":"2025-12-31","ids":{"openalex":"https://openalex.org/W7117688311","doi":"https://doi.org/10.1145/3737611.3776946"},"language":null,"primary_location":{"id":"doi:10.1145/3737611.3776946","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3737611.3776946","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Companion Proceedings of the 27th International Conference on Distributed Computing and Networking","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3737611.3776946","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080322172","display_name":"T. J. Yamada","orcid":null},"institutions":[{"id":"https://openalex.org/I197274945","display_name":"Nagoya Institute of Technology","ror":"https://ror.org/055yf1005","country_code":"JP","type":"education","lineage":["https://openalex.org/I197274945"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Tota Yamada","raw_affiliation_strings":["Nagoya Institute of Technology, Nagoya-shi, Aichi-ken, Japan"],"raw_orcid":"https://orcid.org/0009-0001-2524-9561","affiliations":[{"raw_affiliation_string":"Nagoya Institute of Technology, Nagoya-shi, Aichi-ken, Japan","institution_ids":["https://openalex.org/I197274945"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5121689635","display_name":"Yonghwan Kim","orcid":null},"institutions":[{"id":"https://openalex.org/I197274945","display_name":"Nagoya Institute of Technology","ror":"https://ror.org/055yf1005","country_code":"JP","type":"education","lineage":["https://openalex.org/I197274945"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yonghwan Kim","raw_affiliation_strings":["Nagoya Institute of Technology, Nagoya-shi, Aichi-ken, Japan"],"raw_orcid":"https://orcid.org/0000-0002-5437-7626","affiliations":[{"raw_affiliation_string":"Nagoya Institute of Technology, Nagoya-shi, Aichi-ken, Japan","institution_ids":["https://openalex.org/I197274945"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087271003","display_name":"Yoshiaki Katayama","orcid":null},"institutions":[{"id":"https://openalex.org/I197274945","display_name":"Nagoya Institute of Technology","ror":"https://ror.org/055yf1005","country_code":"JP","type":"education","lineage":["https://openalex.org/I197274945"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yoshiaki Katayama","raw_affiliation_strings":["Nagoya Institute of Technology, Nagoya-shi, Aichi-ken, Japan"],"raw_orcid":"https://orcid.org/0000-0003-1683-2154","affiliations":[{"raw_affiliation_string":"Nagoya Institute of Technology, Nagoya-shi, Aichi-ken, Japan","institution_ids":["https://openalex.org/I197274945"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5080322172"],"corresponding_institution_ids":["https://openalex.org/I197274945"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.65319019,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"44","last_page":"45"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.5953999757766724,"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"}},"topics":[{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.5953999757766724,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.12250000238418579,"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.12049999833106995,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/pentagon","display_name":"Pentagon","score":0.9092000126838684},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.7919999957084656},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.7468000054359436},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.4562999904155731},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.41449999809265137},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40540000796318054},{"id":"https://openalex.org/keywords/partition-problem","display_name":"Partition problem","score":0.32989999651908875},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.32170000672340393}],"concepts":[{"id":"https://openalex.org/C2779965921","wikidata":"https://www.wikidata.org/wiki/Q127840","display_name":"Pentagon","level":2,"score":0.9092000126838684},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.7919999957084656},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7468000054359436},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7448999881744385},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6751999855041504},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.4562999904155731},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.41449999809265137},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40540000796318054},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3984000086784363},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35510000586509705},{"id":"https://openalex.org/C35995877","wikidata":"https://www.wikidata.org/wiki/Q1065968","display_name":"Partition problem","level":3,"score":0.32989999651908875},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.32170000672340393},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.30570000410079956},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.29420000314712524},{"id":"https://openalex.org/C178744013","wikidata":"https://www.wikidata.org/wiki/Q5502876","display_name":"Frequency partition of a graph","level":5,"score":0.28929999470710754},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.28790000081062317},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.2782999873161316},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.2773999869823456},{"id":"https://openalex.org/C2993105083","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Simple graph","level":3,"score":0.272599995136261},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.2680000066757202},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.25519999861717224},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2549000084400177}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3737611.3776946","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3737611.3776946","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Companion Proceedings of the 27th International Conference on Distributed Computing and Networking","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3737611.3776946","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3737611.3776946","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Companion Proceedings of the 27th International Conference on Distributed Computing and Networking","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W2111132249","https://openalex.org/W2159067821","https://openalex.org/W2669273185"],"related_works":[],"abstract_inverted_index":{"Given":[0],"a":[1,8,29,57,107,121],"connected":[2],"graph":[3],"G":[4],"=":[5,21,49,68],"(V,":[6],"E),":[7],"set":[9,74],"of":[10,13,43,60,75,104],"disjoint":[11],"subsets":[12,79],"nodes":[14,76],"\u03c0":[15,82,90],"\u2254":[16],"{V1,":[17],"\u22c5\u22c5\u22c5,":[18],"Vk}":[19],"(V":[20],"V1":[22],"\u222a":[23,25],"\u22c5\u22c5\u22c5":[24],"Vk)":[26],"is":[27,91,109],"called":[28,92,110],"pentagon":[30,88,113,128],"partition":[31,89,108,114,129],"if":[32,94],"each":[33],"subset":[34],"Vi":[35,80],"(1":[36],"\u2264":[37,39],"i":[38],"k)":[40],"satisfies":[41],"one":[42],"the":[44,52,73,95,111,126],"following":[45],"conditions:":[46],"(1)":[47],"|Vi|":[48,67],"5":[50,62],"and":[51],"induced":[53,96],"subgraph":[54,97],"G[Vi]":[55],"contains":[56,99],"simple":[58],"cycle":[59],"length":[61],"(called":[63],"pentagon),":[64],"or":[65],"(2)":[66],"1.":[69],"Let":[70],"S":[71],"denote":[72],"belonging":[77],"to":[78,124],"\u2208":[81],"that":[83],"satisfy":[84],"condition":[85],"(2).":[86],"A":[87],"maximal":[93,112,127],"G[S]":[98],"no":[100],"pentagon.":[101],"The":[102],"problem":[103],"finding":[105],"such":[106],"problem.":[115,130],"In":[116],"this":[117],"paper,":[118],"we":[119],"propose":[120],"self-stabilizing":[122],"algorithm":[123],"solve":[125]},"counts_by_year":[],"updated_date":"2025-12-31T23:15:30.938425","created_date":"2025-12-31T00:00:00"}