{"id":"https://openalex.org/W2078291000","doi":"https://doi.org/10.1145/2414815.2414819","title":"Self-stabilizing algorithm for maximal graph decomposition into disjoint paths of fixed length","display_name":"Self-stabilizing algorithm for maximal graph decomposition into disjoint paths of fixed length","publication_year":2012,"publication_date":"2012-12-17","ids":{"openalex":"https://openalex.org/W2078291000","doi":"https://doi.org/10.1145/2414815.2414819","mag":"2078291000"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1145/2414815.2414819","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"preprint","type_crossref":"proceedings-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/A5015860363","display_name":"Brahim Neggazi","orcid":null},"institutions":[{"id":"https://openalex.org/I100532134","display_name":"Universit\u00e9 Claude Bernard Lyon 1","ror":"https://ror.org/029brtt94","country_code":"FR","type":"funder","lineage":["https://openalex.org/I100532134","https://openalex.org/I203339264"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Brahim Neggazi","raw_affiliation_strings":["Universit\u00e9 de Lyon, France"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Lyon, France","institution_ids":["https://openalex.org/I100532134"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056964260","display_name":"Mohammed Haddad","orcid":"https://orcid.org/0000-0002-8699-7520"},"institutions":[{"id":"https://openalex.org/I100532134","display_name":"Universit\u00e9 Claude Bernard Lyon 1","ror":"https://ror.org/029brtt94","country_code":"FR","type":"funder","lineage":["https://openalex.org/I100532134","https://openalex.org/I203339264"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mohammed Haddad","raw_affiliation_strings":["Universit\u00e9 de Lyon, France"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Lyon, France","institution_ids":["https://openalex.org/I100532134"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111829027","display_name":"Hammamache Kheddouci","orcid":null},"institutions":[{"id":"https://openalex.org/I100532134","display_name":"Universit\u00e9 Claude Bernard Lyon 1","ror":"https://ror.org/029brtt94","country_code":"FR","type":"funder","lineage":["https://openalex.org/I100532134","https://openalex.org/I203339264"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Hammamache Kheddouci","raw_affiliation_strings":["Universit\u00e9 de Lyon, France"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Lyon, France","institution_ids":["https://openalex.org/I100532134"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":2,"citation_normalized_percentile":{"value":0.706617,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":72,"max":75},"biblio":{"volume":null,"issue":null,"first_page":"15","last_page":"19"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9995,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9995,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9981,"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.9979,"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/disjoint-sets","display_name":"Disjoint sets","score":0.71953565}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.71953565},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.58357465},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5589174},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5560566},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.53547066},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46325335},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3484494},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34711707}],"mesh":[],"locations_count":3,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1145/2414815.2414819","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},{"is_oa":false,"landing_page_url":"https://hal.archives-ouvertes.fr/hal-01353133","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":["Centre National de la Recherche Scientifique"],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},{"is_oa":false,"landing_page_url":"https://hal.science/hal-01353133","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":10,"referenced_works":["https://openalex.org/W1496231268","https://openalex.org/W1538070674","https://openalex.org/W1555629290","https://openalex.org/W2024667950","https://openalex.org/W2034396486","https://openalex.org/W2099609440","https://openalex.org/W2111132249","https://openalex.org/W2113513143","https://openalex.org/W2153107964","https://openalex.org/W76549379"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W4247536566","https://openalex.org/W4241418540","https://openalex.org/W3119814709","https://openalex.org/W2725786787","https://openalex.org/W2404647514","https://openalex.org/W2018477250","https://openalex.org/W1667647204","https://openalex.org/W1553466895","https://openalex.org/W1508895727"],"abstract_inverted_index":{"The":[0],"graph":[1,8,25,49,86],"decomposition":[2,26],"problem":[3],"consists":[4],"of":[5,32,46,53,77],"dividing":[6],"a":[7,43],"into":[9,27,50],"components,":[10],"patterns":[11],"or":[12],"partitions":[13],"which":[14],"satisfy":[15],"some":[16],"specifications.":[17],"In":[18],"this":[19],"paper,":[20],"we":[21,58,64],"give":[22,59],"interest":[23],"to":[24],"particular":[28],"patterns:":[29],"disjoint":[30,51],"paths":[31],"length":[33,54],"two.":[34],"We":[35],"present":[36],"the":[37,60,75,81,85],"first":[38],"Self-stabilizing":[39],"algorithm":[40],"for":[41],"finding":[42],"Maximal":[44],"Decomposition":[45],"an":[47],"arbitrary":[48],"Paths":[52],"two":[55],"(SMDP).":[56],"Then,":[57],"correctness":[61],"proof":[62],"and":[63,79],"show":[65],"that":[66],"SMDP":[67],"converges":[68],"in":[69,84],"O(\u0394m)":[70],"moves":[71],"where":[72],"m":[73],"is":[74],"number":[76],"edges":[78],"\u0394":[80],"maximum":[82],"degree":[83],"G.":[87]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2078291000","counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-03-23T19:06:37.976273","created_date":"2016-06-24"}