{"id":"https://openalex.org/W2162732282","doi":"https://doi.org/10.1109/iscc.2009.5202302","title":"On Finding maximally redundant trees in strictly linear time","display_name":"On Finding maximally redundant trees in strictly linear time","publication_year":2009,"publication_date":"2009-07-01","ids":{"openalex":"https://openalex.org/W2162732282","doi":"https://doi.org/10.1109/iscc.2009.5202302","mag":"2162732282"},"language":"en","primary_location":{"id":"doi:10.1109/iscc.2009.5202302","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscc.2009.5202302","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE Symposium on Computers and Communications","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/A5007111554","display_name":"G\u00e1bor Enyedi","orcid":null},"institutions":[{"id":"https://openalex.org/I29770179","display_name":"Budapest University of Technology and Economics","ror":"https://ror.org/02w42ss30","country_code":"HU","type":"education","lineage":["https://openalex.org/I29770179"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Gabor Enyedi","raw_affiliation_strings":["Dept. of Telecommunications and Media Informatics, Budapest University of Technology and Economics, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Telecommunications and Media Informatics, Budapest University of Technology and Economics, Hungary","institution_ids":["https://openalex.org/I29770179"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016237009","display_name":"Gabor Retvaria","orcid":null},"institutions":[{"id":"https://openalex.org/I29770179","display_name":"Budapest University of Technology and Economics","ror":"https://ror.org/02w42ss30","country_code":"HU","type":"education","lineage":["https://openalex.org/I29770179"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Gabor Retvaria","raw_affiliation_strings":["Budapesti Muszaki es Gazdasagtudomanyi Egyetem, Budapest, HU"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Budapesti Muszaki es Gazdasagtudomanyi Egyetem, Budapest, HU","institution_ids":["https://openalex.org/I29770179"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071754086","display_name":"Andr\u00e1s Cs\u00e1sz\u00e1r","orcid":null},"institutions":[{"id":"https://openalex.org/I1306339040","display_name":"Ericsson (Sweden)","ror":"https://ror.org/05a7rhx54","country_code":"SE","type":"company","lineage":["https://openalex.org/I1306339040"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Andras Csaszar","raw_affiliation_strings":["Traffic Lab, Ericsson Research","Traffic Laboratory, Ericsson Research Limited, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Traffic Lab, Ericsson Research","institution_ids":["https://openalex.org/I1306339040"]},{"raw_affiliation_string":"Traffic Laboratory, Ericsson Research Limited, Sweden","institution_ids":["https://openalex.org/I1306339040"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2207,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.82150136,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"206","last_page":"211"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9991999864578247,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9986000061035156,"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/time-complexity","display_name":"Time complexity","score":0.789564847946167},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.7584375143051147},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6787458658218384},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6478791236877441},{"id":"https://openalex.org/keywords/social-connectedness","display_name":"Social connectedness","score":0.6414607763290405},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.6108300685882568},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41920000314712524},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38107427954673767},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3683646321296692},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3383415937423706},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.18631094694137573},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.161571204662323}],"concepts":[{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.789564847946167},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7584375143051147},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6787458658218384},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6478791236877441},{"id":"https://openalex.org/C201943243","wikidata":"https://www.wikidata.org/wiki/Q7551008","display_name":"Social connectedness","level":2,"score":0.6414607763290405},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.6108300685882568},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41920000314712524},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38107427954673767},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3683646321296692},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3383415937423706},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.18631094694137573},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.161571204662323},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C542102704","wikidata":"https://www.wikidata.org/wiki/Q183257","display_name":"Psychotherapist","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/iscc.2009.5202302","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscc.2009.5202302","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE Symposium on Computers and Communications","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.190.6158","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.190.6158","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://qosip.tmit.bme.hu/%7Eretvari/publications/redtrees_iscc2009.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.49000000953674316,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1507189594","https://openalex.org/W1930334158","https://openalex.org/W2022175859","https://openalex.org/W2058324257","https://openalex.org/W2098862160","https://openalex.org/W2139998597","https://openalex.org/W2141595029","https://openalex.org/W2159429851","https://openalex.org/W4241856973","https://openalex.org/W6665386985"],"related_works":["https://openalex.org/W1667647204","https://openalex.org/W2404647514","https://openalex.org/W4247536566","https://openalex.org/W3125761283","https://openalex.org/W2018477250","https://openalex.org/W3119814709","https://openalex.org/W4241418540","https://openalex.org/W2164081328","https://openalex.org/W4391009474","https://openalex.org/W2170725231"],"abstract_inverted_index":{"Redundant":[0],"trees":[1,23,76],"are":[2],"commonly":[3],"used":[4],"for":[5],"protection":[6],"and":[7,51],"restoration":[8],"in":[9,24,32],"communications":[10],"networks.":[11],"Zhang":[12],"et":[13],"al.":[14],"presented":[15],"a":[16,61,83,96],"linear":[17,52,66],"time":[18,67],"algorithm":[19,47,63],"to":[20,44,80],"compute":[21],"node-redundant":[22,75],"2-node-connected":[25,78],"networks,":[26],"which":[27],"has":[28],"become":[29],"widely":[30],"cited":[31],"the":[33,55,72],"literature.":[34],"In":[35],"this":[36,46],"paper,":[37],"we":[38,59,70],"show":[39],"that":[40],"it":[41],"is":[42],"difficult":[43],"implement":[45],"providing":[48],"both":[49],"correctness":[50],"complexity":[53],"at":[54],"same":[56],"time.":[57],"Therefore,":[58],"present":[60],"revised":[62],"with":[64],"strict":[65],"complexity.":[68],"Moreover,":[69],"generalize":[71],"concept":[73],"of":[74],"from":[77],"networks":[79,88],"arbitrary":[81],"topologies,":[82],"crucial":[84],"development":[85],"since":[86],"real":[87],"can":[89],"not":[90],"always":[91],"satisfy":[92],"2-connectedness,":[93],"especially":[94],"after":[95],"failure.":[97]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}