{"id":"https://openalex.org/W2609115092","doi":"https://doi.org/10.1109/icmcs.2016.7905555","title":"Complexity of closed networks based on spanning tree approach","display_name":"Complexity of closed networks based on spanning tree approach","publication_year":2016,"publication_date":"2016-09-01","ids":{"openalex":"https://openalex.org/W2609115092","doi":"https://doi.org/10.1109/icmcs.2016.7905555","mag":"2609115092"},"language":"en","primary_location":{"id":"doi:10.1109/icmcs.2016.7905555","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icmcs.2016.7905555","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 5th International Conference on Multimedia Computing and Systems (ICMCS)","raw_type":"proceedings-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/A5010269822","display_name":"Hajar Sahbani","orcid":"https://orcid.org/0000-0002-1023-8659"},"institutions":[{"id":"https://openalex.org/I126477371","display_name":"Mohammed V University","ror":"https://ror.org/00r8w8f84","country_code":"MA","type":"education","lineage":["https://openalex.org/I126477371"]}],"countries":["MA"],"is_corresponding":false,"raw_author_name":"Hajar Sahbani","raw_affiliation_strings":["Faculty of Science, Mohammed V University, Rabat, Morocco"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Science, Mohammed V University, Rabat, Morocco","institution_ids":["https://openalex.org/I126477371"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110439926","display_name":"Mohamed El Marraki","orcid":null},"institutions":[{"id":"https://openalex.org/I126477371","display_name":"Mohammed V University","ror":"https://ror.org/00r8w8f84","country_code":"MA","type":"education","lineage":["https://openalex.org/I126477371"]}],"countries":["MA"],"is_corresponding":false,"raw_author_name":"Mohamed El Marraki","raw_affiliation_strings":["Faculty of Science, Mohammed V University, Rabat, Morocco"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Science, Mohammed V University, Rabat, Morocco","institution_ids":["https://openalex.org/I126477371"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I126477371"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.28866738,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":null,"first_page":"554","last_page":"557"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10780","display_name":"Reliability and Maintenance Optimization","score":0.9717000126838684,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10780","display_name":"Reliability and Maintenance Optimization","score":0.9717000126838684,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9668999910354614,"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/T12423","display_name":"Software Reliability and Analysis Research","score":0.9470999836921692,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/spanning-tree","display_name":"Spanning tree","score":0.870587170124054},{"id":"https://openalex.org/keywords/tr\u00e9maux-tree","display_name":"Tr\u00e9maux tree","score":0.6914249062538147},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5799113512039185},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.55996173620224},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.4756490886211395},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4461987018585205},{"id":"https://openalex.org/keywords/algebraic-connectivity","display_name":"Algebraic connectivity","score":0.4426383972167969},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4362565875053406},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.43622469902038574},{"id":"https://openalex.org/keywords/reliability","display_name":"Reliability (semiconductor)","score":0.42493370175361633},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3964571952819824},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3781132400035858},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.370805948972702},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.17381933331489563},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.15073689818382263}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.870587170124054},{"id":"https://openalex.org/C124302570","wikidata":"https://www.wikidata.org/wiki/Q7849146","display_name":"Tr\u00e9maux tree","level":5,"score":0.6914249062538147},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5799113512039185},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.55996173620224},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.4756490886211395},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4461987018585205},{"id":"https://openalex.org/C7948225","wikidata":"https://www.wikidata.org/wiki/Q4723998","display_name":"Algebraic connectivity","level":4,"score":0.4426383972167969},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4362565875053406},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.43622469902038574},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.42493370175361633},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3964571952819824},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3781132400035858},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.370805948972702},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.17381933331489563},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.15073689818382263},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icmcs.2016.7905555","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icmcs.2016.7905555","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 5th International Conference on Multimedia Computing and Systems (ICMCS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W93214412","https://openalex.org/W1489095222","https://openalex.org/W1918926446","https://openalex.org/W1994213318","https://openalex.org/W2027400551","https://openalex.org/W2029673229","https://openalex.org/W2039887190","https://openalex.org/W2117889403","https://openalex.org/W2513271741","https://openalex.org/W2539956009","https://openalex.org/W6603780473","https://openalex.org/W6648847876","https://openalex.org/W6677609702","https://openalex.org/W6726008779"],"related_works":["https://openalex.org/W4380840098","https://openalex.org/W2138987445","https://openalex.org/W2014991506","https://openalex.org/W2911818503","https://openalex.org/W1738503018","https://openalex.org/W1842018596","https://openalex.org/W2307044859","https://openalex.org/W3195481350","https://openalex.org/W2069643240","https://openalex.org/W2621339359"],"abstract_inverted_index":{"In":[0,58,136],"a":[1,10,18,29,82,86,109,123,141,191],"planar":[2],"graph":[3,83],"G,":[4,22],"it":[5],"is":[6,27,49,185],"easy":[7],"to":[8,67,93,111,179,188],"find":[9,37],"tree":[11,31],"that":[12,84,168,181],"contains":[13],"all":[14],"the":[15,59,97,102,113,145,161,182,186],"vertices":[16],"and":[17,73,107],"few":[19],"edges":[20],"of":[21,32,41,44,78,81,96,104,115,144,147,156,163,177],"such":[23],"as":[24],"this":[25,56,68,137,170],"subgraph":[26],"called":[28,89,159],"spanning":[30,52,79,116,157],"G.":[33],"We":[34],"can":[35,54],"also":[36,88,132,160],"two":[38],"or":[39],"three":[40],"these":[42],"types":[43],"trees.":[45],"The":[46],"dificult":[47],"question":[48,69],"how":[50],"many":[51],"trees":[53,80,117,158],"contain":[55],"graph?":[57],"literature,":[60],"several":[61],"researchers":[62],"have":[63],"found":[64],"an":[65,174],"answer":[66],"by":[70,165],"proposing":[71],"algebraic":[72],"combinatorial":[74],"methods.":[75],"This":[76],"number":[77,114,155],"describes":[85],"network":[87],"it's":[90],"complexity":[91,162,171],"tends":[92],"be":[94],"one":[95],"most":[98],"natural":[99],"characteristics":[100],"from":[101],"viewpoint":[103],"its":[105],"reliability,":[106],"deriving":[108],"formula":[110],"count":[112],"for":[118,190],"various":[119],"graphs":[120,164],"has":[121],"become":[122],"vital":[124],"role":[125],"not":[126],"only":[127],"in":[128,133],"applied":[129],"mathematics":[130],"but":[131],"computer":[134],"science.":[135],"paper":[138],"we":[139],"present":[140],"comparative":[142],"study":[143],"reliability":[146,178],"some":[148],"proposed":[149,183],"closed":[150],"networks":[151],"based":[152],"on":[153],"their":[154],"finding":[166],"formulas":[167],"compute":[169],"which":[172],"represent":[173],"important":[175],"measure":[176],"deduce":[180],"topology":[184],"best":[187],"adopt":[189],"more":[192],"reliable":[193],"routing.":[194]},"counts_by_year":[],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}