{"id":"https://openalex.org/W3144520189","doi":"https://doi.org/10.1109/ccwc51732.2021.9375920","title":"On distributed forest decomposition of graphs with bounded arboricity","display_name":"On distributed forest decomposition of graphs with bounded arboricity","publication_year":2021,"publication_date":"2021-01-27","ids":{"openalex":"https://openalex.org/W3144520189","doi":"https://doi.org/10.1109/ccwc51732.2021.9375920","mag":"3144520189"},"language":"en","primary_location":{"id":"doi:10.1109/ccwc51732.2021.9375920","doi":"https://doi.org/10.1109/ccwc51732.2021.9375920","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccwc51732.2021.9375920","pdf_url":null,"source":{"id":"https://openalex.org/S4363608098","display_name":"IEEE Annual Computing and Communication Workshop and Conference (CCWC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE 11th Annual Computing and Communication Workshop and Conference (CCWC)","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"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/A5001223224","display_name":"Narek Hovhannisyan","orcid":"https://orcid.org/0000-0003-0909-8473","observed_orcids":["https://orcid.org/0000-0003-0909-8473"]},"institutions":[{"id":"https://openalex.org/I187562900","display_name":"American University of Armenia","ror":"https://ror.org/04dngzj56","country_code":"AM","type":"education","lineage":["https://openalex.org/I187562900"]}],"countries":["AM"],"is_corresponding":true,"raw_author_name":"Narek Hovhannisyan","raw_affiliation_strings":["Computer and Information Science, American University of Armenia, Yerevan, Armenia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer and Information Science, American University of Armenia, Yerevan, Armenia","institution_ids":["https://openalex.org/I187562900"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5001223224"],"corresponding_institution_ids":["https://openalex.org/I187562900"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"55","issue":null,"first_page":"0334","last_page":"0340"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.7871000170707703,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.7871000170707703,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.10209999978542328,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.09640000015497208,"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/forest-decomposition","display_name":"forest decomposition","score":0.9259999990463257},{"id":"https://openalex.org/keywords/distributed-graph-algorithms","display_name":"distributed graph algorithms","score":0.8510000109672546},{"id":"https://openalex.org/keywords/graph-representation","display_name":"graph representation","score":0.6320000290870667},{"id":"https://openalex.org/keywords/secure-communication","display_name":"secure communication","score":0.7289999723434448},{"id":"https://openalex.org/keywords/man-in-the-middle-attacks","display_name":"man-in-the-middle attacks","score":0.9559999704360962},{"id":"https://openalex.org/keywords/load-balancing","display_name":"load balancing","score":0.8840000033378601},{"id":"https://openalex.org/keywords/distributed-networks","display_name":"distributed networks","score":0.5690000057220459}],"concepts":[{"id":"https://openalex.org/C83204008","wikidata":"https://www.wikidata.org/wiki/Q4784907","display_name":"Arboricity","level":4,"score":0.8558623194694519},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6954529881477356},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5848513245582581},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5201871395111084},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49755170941352844},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.4873664975166321},{"id":"https://openalex.org/C13251829","wikidata":"https://www.wikidata.org/wiki/Q3085841","display_name":"Dense graph","level":5,"score":0.45477861166000366},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.4208206236362457},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.4140441417694092},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34356454014778137},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.29848259687423706},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.23791468143463135},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23095771670341492},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.21284162998199463},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.16844776272773743},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.12878203392028809},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ccwc51732.2021.9375920","doi":"https://doi.org/10.1109/ccwc51732.2021.9375920","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccwc51732.2021.9375920","pdf_url":null,"source":{"id":"https://openalex.org/S4363608098","display_name":"IEEE Annual Computing and Communication Workshop and Conference (CCWC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE 11th Annual Computing and Communication Workshop and Conference (CCWC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W80592621","https://openalex.org/W1964089073","https://openalex.org/W1996066664","https://openalex.org/W1998643836","https://openalex.org/W1999120866","https://openalex.org/W2006040238","https://openalex.org/W2007218972","https://openalex.org/W2010042187","https://openalex.org/W2011894656","https://openalex.org/W2017492483","https://openalex.org/W2022155283","https://openalex.org/W2025904765","https://openalex.org/W2042497320","https://openalex.org/W2042706982","https://openalex.org/W2060963839","https://openalex.org/W2063026346","https://openalex.org/W2082903339","https://openalex.org/W2122639972","https://openalex.org/W2123829666","https://openalex.org/W2158484957","https://openalex.org/W2169102947","https://openalex.org/W2169475202","https://openalex.org/W2751550350","https://openalex.org/W2952208722"],"related_works":["https://openalex.org/W3088901619","https://openalex.org/W4302591342","https://openalex.org/W1974912205","https://openalex.org/W3113645349","https://openalex.org/W7098369516","https://openalex.org/W3046572849","https://openalex.org/W3042306968","https://openalex.org/W1982618738","https://openalex.org/W7099228851","https://openalex.org/W7100335411"],"abstract_inverted_index":{"Efficient":[0],"data":[1,131],"representation":[2,128,147],"and":[3,92,129,153],"secure":[4,130],"communication":[5,132],"are":[6,16,47],"both":[7,17,59],"crucial":[8],"problems":[9,15],"in":[10,19,35,38,133],"the":[11,20,90,116,119,123,138,141],"modern":[12],"world.":[13],"Those":[14],"actual":[18],"distributed":[21,36,134],"context":[22],"as":[23],"well.":[24],"In":[25],"this":[26],"article":[27],"we":[28,105],"focus":[29],"on":[30,143],"forest":[31],"decomposition":[32],"of":[33,75,118,125,140,148,158],"graphs":[34],"networks":[37],"order":[39],"to":[40,88],"impact":[41,139],"those":[42],"two":[43],"problems.":[44],"Currently,":[45],"there":[46],"several":[48],"existing":[49],"algorithms":[50],"that":[51,78,84],"decompose":[52],"generic":[53],"or":[54,62],"restricted":[55],"graph":[56,98,102,127],"instances":[57,99],"with":[58,67,110],"bounded":[60],"degree":[61],"arboricity":[63],"into":[64],"edge-disjoint":[65],"forests":[66],"sublogarithmic":[68],"running":[69],"time.":[70],"We":[71,113],"propose":[72],"a":[73],"modification":[74],"an":[76,94,145],"algorithm":[77,91,120,142],"was":[79],"already":[80],"devised":[81],"before,":[82],"such":[83],"it":[85],"is":[86],"possible":[87],"implement":[89],"conduct":[93],"experiment":[95],"over":[96],"simulated":[97],"from":[100],"different":[101],"families.":[103],"Finally,":[104],"compare":[106],"achieved":[107],"experimental":[108],"results":[109],"theoretical":[111],"estimates.":[112],"also":[114],"discuss":[115],"application":[117],"for":[121],"solving":[122],"problem":[124],"efficient":[126,155],"networks.":[135,159],"More":[136],"specifically,":[137],"implementing":[144,154],"implicit":[146],"graphs,":[149],"overcoming":[150],"man-in-the-middle":[151],"attacks":[152],"load":[156],"balancing":[157]},"counts_by_year":[],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2021-04-13T00:00:00"}