{"id":"https://openalex.org/W4309592304","doi":"https://doi.org/10.1142/s179383092250183x","title":"A linear algorithm for the neighbor-component order connectivity of arbitrary trees","display_name":"A linear algorithm for the neighbor-component order connectivity of arbitrary trees","publication_year":2022,"publication_date":"2022-11-16","ids":{"openalex":"https://openalex.org/W4309592304","doi":"https://doi.org/10.1142/s179383092250183x"},"language":"en","primary_location":{"id":"doi:10.1142/s179383092250183x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s179383092250183x","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"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":"Discrete Mathematics, Algorithms and Applications","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/A5056864708","display_name":"Kristi Luttrell","orcid":"https://orcid.org/0000-0003-0742-1011"},"institutions":[{"id":"https://openalex.org/I12524447","display_name":"Seton Hall University","ror":"https://ror.org/007tn5k56","country_code":"US","type":"education","lineage":["https://openalex.org/I12524447"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Kristi Luttrell","raw_affiliation_strings":["Mathematics Department, Seton Hall University, 400 South Orange Avenue, South Orange, NJ 07926, USA"],"raw_orcid":"https://orcid.org/0000-0003-0742-1011","affiliations":[{"raw_affiliation_string":"Mathematics Department, Seton Hall University, 400 South Orange Avenue, South Orange, NJ 07926, USA","institution_ids":["https://openalex.org/I12524447"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5056864708"],"corresponding_institution_ids":["https://openalex.org/I12524447"],"apc_list":null,"apc_paid":null,"fwci":0.1424,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.50820495,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"16","issue":"01","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998000264167786,"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.9998000264167786,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987000226974487,"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.9966999888420105,"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/connected-component","display_name":"Connected component","score":0.7198667526245117},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.6144821047782898},{"id":"https://openalex.org/keywords/component","display_name":"Component (thermodynamics)","score":0.5255835652351379},{"id":"https://openalex.org/keywords/giant-component","display_name":"Giant component","score":0.4966049790382385},{"id":"https://openalex.org/keywords/connectivity","display_name":"Connectivity","score":0.4827365279197693},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4509276747703552},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4450899660587311},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4428558051586151},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.4385395646095276},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4240935444831848},{"id":"https://openalex.org/keywords/strongly-connected-component","display_name":"Strongly connected component","score":0.4192076623439789},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41793274879455566},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3795742094516754},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3609575033187866},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3267894387245178},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.2090953290462494},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09042832255363464}],"concepts":[{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.7198667526245117},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.6144821047782898},{"id":"https://openalex.org/C168167062","wikidata":"https://www.wikidata.org/wiki/Q1117970","display_name":"Component (thermodynamics)","level":2,"score":0.5255835652351379},{"id":"https://openalex.org/C148818006","wikidata":"https://www.wikidata.org/wiki/Q4137985","display_name":"Giant component","level":4,"score":0.4966049790382385},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.4827365279197693},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4509276747703552},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4450899660587311},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4428558051586151},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.4385395646095276},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4240935444831848},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.4192076623439789},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41793274879455566},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3795742094516754},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3609575033187866},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3267894387245178},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.2090953290462494},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09042832255363464},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C97355855","wikidata":"https://www.wikidata.org/wiki/Q11473","display_name":"Thermodynamics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s179383092250183x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s179383092250183x","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"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":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4699999988079071,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W623038018","https://openalex.org/W1981271750","https://openalex.org/W2019861052","https://openalex.org/W2067396114","https://openalex.org/W2071850839"],"related_works":["https://openalex.org/W938372727","https://openalex.org/W2756564215","https://openalex.org/W4379118151","https://openalex.org/W3019714789","https://openalex.org/W2039866832","https://openalex.org/W1999992729","https://openalex.org/W2014594560","https://openalex.org/W1984251932","https://openalex.org/W2804933047","https://openalex.org/W2705565640"],"abstract_inverted_index":{"The":[0,57,186],"graph":[1,106,174,196,206],"parameter":[2,180],"neighbor-connectivity":[3,76,123],"was":[4],"first":[5],"investigated":[6],"by":[7],"Gunther":[8],"and":[9,13,51,199,245],"Hartnell":[10],"in":[11,66,91,99],"1987":[12],"provides":[14],"important":[15],"information":[16],"on":[17],"how":[18],"reliable":[19],"a":[20,27,39,105,125,147,163,173,205,218],"network":[21,148],"can":[22],"be":[23,109,119,144],"when":[24,103],"failures":[25],"of":[26,38,44,60,77,95,139,166,172,183,188,193,204,227,242,251],"node":[28,40,50],"may":[29,108],"impact":[30],"its":[31,45,52],"neighbors.":[32],"In":[33],"this":[34],"model,":[35,128],"the":[36,42,49,75,78,92,136,168,178,184,190,223,238,248,252],"failure":[37],"causes":[41],"deletion":[43],"closed":[46,61,140],"neighborhood,":[47],"i.e.,":[48],"adjacent":[53],"neighbors":[54],"as":[55,135],"well.":[56],"minimum":[58,137],"number":[59,138,182,192,250],"neighborhoods":[62,141],"whose":[63],"removal":[64],"results":[65],"an":[67,194,208,228,232],"empty,":[68],"complete,":[69],"or":[70],"disconnected":[71],"subgraph":[72],"is":[73,175,197,212],"called":[74],"graph.":[79,185],"Since":[80],"then":[81],"component":[82,126],"order":[83,127,132,155,170,202,225],"connectivity":[84,171,203,226],"models":[85,94],"have":[86,154],"emerged":[87],"to":[88,117,124,149,177],"address":[89],"inadequacies":[90],"traditional":[93],"connectivity,":[96,133],"namely,":[97],"that":[98,113,142],"many":[100],"real-world":[101],"networks,":[102],"disconnecting":[104],"one":[107],"left":[110],"with":[111],"components":[112,153],"are":[114],"large":[115],"enough":[116],"still":[118],"operable.":[120],"By":[121],"adapting":[122],"we":[129,216],"introduced":[130],"neighbor-component":[131,169,201,224],"defined":[134],"must":[143],"removed":[145],"from":[146],"ensure":[150],"all":[151],"remaining":[152],"less":[156],"than":[157],"some":[158],"given":[159],"threshold":[160,164,210,234],"value.":[161],"Given":[162],"value":[165,211],"one,":[167],"equivalent":[176],"well-known":[179],"domination":[181,191,249],"problem":[187],"computing":[189,200,222],"arbitrary":[195,209,229,233],"NP-hard,":[198],"for":[207,221,231,247],"also":[213],"NP-hard.":[214],"Here,":[215],"present":[217],"linear-time":[219],"algorithm":[220,241],"tree":[230],"value,":[235],"thus":[236],"generalizing":[237],"classic":[239],"linear":[240],"Cockayne,":[243],"Goodman,":[244],"Hedetniemi":[246],"tree.":[253]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}