{"id":"https://openalex.org/W2023705704","doi":"https://doi.org/10.1109/isit.2013.6620334","title":"Cyclic linking network","display_name":"Cyclic linking network","publication_year":2013,"publication_date":"2013-07-01","ids":{"openalex":"https://openalex.org/W2023705704","doi":"https://doi.org/10.1109/isit.2013.6620334","mag":"2023705704"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2013.6620334","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2013.6620334","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Symposium on Information Theory","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/A5065701256","display_name":"Chung Chan","orcid":"https://orcid.org/0000-0003-2006-0898"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Chung Chan","raw_affiliation_strings":["Institute of Network Coding, Chinese University of Hong Kong, Hong Kong, China",", Institute of Network Coding, Chinese University of Hong Kong, Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"Institute of Network Coding, Chinese University of Hong Kong, Hong Kong, China","institution_ids":["https://openalex.org/I177725633"]},{"raw_affiliation_string":", Institute of Network Coding, Chinese University of Hong Kong, Hong Kong, China","institution_ids":["https://openalex.org/I177725633"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5065701256"],"corresponding_institution_ids":["https://openalex.org/I177725633"],"apc_list":null,"apc_paid":null,"fwci":2.5372,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.90161849,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9991000294685364,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9991000294685364,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9973999857902527,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9973000288009644,"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/disjoint-sets","display_name":"Disjoint sets","score":0.692841112613678},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5912768840789795},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5880010724067688},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5873218774795532},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.5442739129066467},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.5214342474937439},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.5154502987861633},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.5109683275222778},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.43542203307151794},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4299902617931366},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40776491165161133},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.380519300699234},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37575098872184753},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3462720513343811},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33135151863098145},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2854812741279602},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.20805224776268005},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.20258828997612},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1225445568561554}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.692841112613678},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5912768840789795},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5880010724067688},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5873218774795532},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.5442739129066467},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.5214342474937439},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.5154502987861633},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.5109683275222778},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.43542203307151794},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4299902617931366},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40776491165161133},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.380519300699234},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37575098872184753},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3462720513343811},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33135151863098145},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2854812741279602},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.20805224776268005},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.20258828997612},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1225445568561554},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2013.6620334","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2013.6620334","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/14","score":0.6200000047683716,"display_name":"Life below water"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1533712308","https://openalex.org/W1966408535","https://openalex.org/W1978376980","https://openalex.org/W2087169234","https://openalex.org/W2099061975","https://openalex.org/W2105831729","https://openalex.org/W2109962983","https://openalex.org/W2138784417","https://openalex.org/W2141975499"],"related_works":["https://openalex.org/W2375873432","https://openalex.org/W4206915070","https://openalex.org/W2531764854","https://openalex.org/W3161514703","https://openalex.org/W2141299097","https://openalex.org/W1851375266","https://openalex.org/W2610002854","https://openalex.org/W3141113327","https://openalex.org/W4206407367","https://openalex.org/W3035974271"],"abstract_inverted_index":{"A":[0],"general":[1],"network":[2,16,31],"link":[3],"model":[4],"is":[5,53],"formulated,":[6],"unifying":[7],"the":[8,30,41,46,70],"previous":[9],"directed":[10],"cyclic":[11],"graphical":[12],"network,":[13],"linear":[14],"deterministic":[15],"and":[17,50,75],"layered":[18],"linking":[19,60],"network.":[20],"It":[21],"provides":[22],"a":[23],"seamless":[24],"extension":[25],"of":[26,48],"Menger's":[27],"theorem":[28],"that":[29,68],"can":[32],"be":[33],"decomposed":[34],"into":[35],"disjoint":[36],"augmenting":[37],"paths":[38],"up":[39],"to":[40,65],"min-cut":[42],"value":[43],"even":[44],"in":[45],"presence":[47],"cycles":[49],"interference.":[51],"This":[52],"obtained":[54],"by":[55],"developing":[56],"new":[57],"concepts":[58],"for":[59],"systems,":[61],"which":[62],"also":[63],"lead":[64],"polynomial-time":[66],"algorithms":[67],"compute":[69],"shortest":[71],"path,":[72],"maximum":[73],"flow":[74],"optimal":[76],"path":[77],"decomposition.":[78]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}