{"id":"https://openalex.org/W2669273185","doi":"https://doi.org/10.1142/s0129626417500049","title":"A <i>O</i>(<i>m</i>) Self-Stabilizing Algorithm for Maximal Triangle Partition of General Graphs","display_name":"A <i>O</i>(<i>m</i>) Self-Stabilizing Algorithm for Maximal Triangle Partition of General Graphs","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2669273185","doi":"https://doi.org/10.1142/s0129626417500049","mag":"2669273185"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626417500049","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626417500049","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-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/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":"education","lineage":["https://openalex.org/I100532134","https://openalex.org/I203339264"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Brahim Neggazi","raw_affiliation_strings":["University of Claude Bernard Lyon 1, 43 Bd du 11 Novembre 1918, F-69622, Villeurbanne, France"],"affiliations":[{"raw_affiliation_string":"University of Claude Bernard Lyon 1, 43 Bd du 11 Novembre 1918, F-69622, Villeurbanne, France","institution_ids":["https://openalex.org/I100532134"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049573691","display_name":"Volker Turau","orcid":"https://orcid.org/0000-0001-9964-8816"},"institutions":[{"id":"https://openalex.org/I884043246","display_name":"Hamburg University of Technology","ror":"https://ror.org/04bs1pb34","country_code":"DE","type":"education","lineage":["https://openalex.org/I884043246"]},{"id":"https://openalex.org/I159176309","display_name":"Universit\u00e4t Hamburg","ror":"https://ror.org/00g30e956","country_code":"DE","type":"education","lineage":["https://openalex.org/I159176309"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Volker Turau","raw_affiliation_strings":["Hamburg University of Technology, Institute of Telematics, Am Schwarzenberg-Campus 3, 21073 Hamburg, Germany"],"affiliations":[{"raw_affiliation_string":"Hamburg University of Technology, Institute of Telematics, Am Schwarzenberg-Campus 3, 21073 Hamburg, Germany","institution_ids":["https://openalex.org/I159176309","https://openalex.org/I884043246"]}]},{"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":"education","lineage":["https://openalex.org/I100532134","https://openalex.org/I203339264"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mohammed Haddad","raw_affiliation_strings":["University of Claude Bernard Lyon 1, 43 Bd du 11 Novembre 1918, F-69622, Villeurbanne, France"],"affiliations":[{"raw_affiliation_string":"University of Claude Bernard Lyon 1, 43 Bd du 11 Novembre 1918, F-69622, Villeurbanne, France","institution_ids":["https://openalex.org/I100532134"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085901159","display_name":"Hamamache Kheddouci","orcid":"https://orcid.org/0000-0002-5561-6203"},"institutions":[{"id":"https://openalex.org/I100532134","display_name":"Universit\u00e9 Claude Bernard Lyon 1","ror":"https://ror.org/029brtt94","country_code":"FR","type":"education","lineage":["https://openalex.org/I100532134","https://openalex.org/I203339264"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Hamamache Kheddouci","raw_affiliation_strings":["University of Claude Bernard Lyon 1, 43 Bd du 11 Novembre 1918, F-69622, Villeurbanne, France"],"affiliations":[{"raw_affiliation_string":"University of Claude Bernard Lyon 1, 43 Bd du 11 Novembre 1918, F-69622, Villeurbanne, France","institution_ids":["https://openalex.org/I100532134"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5015860363"],"corresponding_institution_ids":["https://openalex.org/I100532134"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.08614928,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"27","issue":"02","first_page":"1750004","last_page":"1750004"},"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.9997000098228455,"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.9997000098228455,"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/T11478","display_name":"Caching and Content Delivery","score":0.9980999827384949,"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/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9979000091552734,"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/combinatorics","display_name":"Combinatorics","score":0.7851760387420654},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.7041193842887878},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.638944149017334},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6251904964447021},{"id":"https://openalex.org/keywords/partition-problem","display_name":"Partition problem","score":0.5672634243965149},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4731658101081848},{"id":"https://openalex.org/keywords/daemon","display_name":"Daemon","score":0.45210760831832886},{"id":"https://openalex.org/keywords/np-complete","display_name":"NP-complete","score":0.4462232291698456},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4164292812347412},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3458227515220642},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.26189762353897095}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7851760387420654},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.7041193842887878},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.638944149017334},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6251904964447021},{"id":"https://openalex.org/C35995877","wikidata":"https://www.wikidata.org/wiki/Q1065968","display_name":"Partition problem","level":3,"score":0.5672634243965149},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4731658101081848},{"id":"https://openalex.org/C2777253204","wikidata":"https://www.wikidata.org/wiki/Q308980","display_name":"Daemon","level":2,"score":0.45210760831832886},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.4462232291698456},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4164292812347412},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3458227515220642},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.26189762353897095},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0129626417500049","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626417500049","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-01653868v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01653868","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":false,"is_in_doaj":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":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Parallel Processing Letters, 2017, 27 (02), &#x27E8;10.1142/S0129626417500049&#x27E9;","raw_type":"Journal articles"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1969483202","https://openalex.org/W1976297454","https://openalex.org/W1980835345","https://openalex.org/W1987888430","https://openalex.org/W2000046463","https://openalex.org/W2006107173","https://openalex.org/W2024667950","https://openalex.org/W2055699612","https://openalex.org/W2070274621","https://openalex.org/W2072562818","https://openalex.org/W2088809694","https://openalex.org/W2100136595","https://openalex.org/W2110600065","https://openalex.org/W2131443605","https://openalex.org/W2151590071","https://openalex.org/W2153107964","https://openalex.org/W2283454896"],"related_works":["https://openalex.org/W55187247","https://openalex.org/W2048339306","https://openalex.org/W2045093350","https://openalex.org/W1817539229","https://openalex.org/W2028295504","https://openalex.org/W2062731608","https://openalex.org/W4392856484","https://openalex.org/W2389783846","https://openalex.org/W4312809402","https://openalex.org/W2606468876"],"abstract_inverted_index":{"The":[0,44],"triangle":[1,45,67],"partition":[2,33,46,68],"problem":[3,12,47],"is":[4,48,59],"a":[5,23,73],"generalization":[6],"of":[7,14,19,41],"the":[8,16,38,57,61,85],"well-known":[9],"graph":[10],"matching":[11],"consisting":[13],"finding":[15],"maximum":[17,39],"number":[18,40],"independent":[20],"edges":[21,27],"in":[22,54,81],"given":[24],"graph,":[25],"i.e.,":[26],"with":[28],"no":[29],"common":[30],"node.":[31],"Triangle":[32],"instead":[34],"aims":[35],"to":[36,50],"find":[37],"disjoint":[42],"triangles.":[43],"known":[49],"be":[51],"NP-complete.":[52],"Thus,":[53,70],"this":[55],"paper,":[56],"focus":[58],"on":[60],"local":[62],"maximization":[63],"variant,":[64],"called":[65],"maximal":[66],"(MTP).":[69],"paper":[71],"presents":[72],"new":[74],"self-stabilizing":[75],"algorithm":[76],"for":[77],"MTP":[78],"that":[79],"converges":[80],"O(m)":[82],"moves":[83],"under":[84],"unfair":[86],"distributed":[87],"daemon.":[88]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2017-06-30T00:00:00"}