{"id":"https://openalex.org/W1996308173","doi":"https://doi.org/10.1109/itw.2006.1633813","title":"On the Coding Advantage of Multiple Unicast Sessions in Undirected Graphs","display_name":"On the Coding Advantage of Multiple Unicast Sessions in Undirected Graphs","publication_year":2006,"publication_date":"2006-05-25","ids":{"openalex":"https://openalex.org/W1996308173","doi":"https://doi.org/10.1109/itw.2006.1633813","mag":"1996308173"},"language":"en","primary_location":{"id":"doi:10.1109/itw.2006.1633813","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2006.1633813","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 IEEE Information Theory Workshop","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/A5041706388","display_name":"Kamal Jain","orcid":"https://orcid.org/0000-0001-5153-0405"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"K. Jain","raw_affiliation_strings":["Microsoft Research One Microsoft Way, Redmond, WA, USA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research One Microsoft Way, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007368382","display_name":"Vijay V. Vazirani","orcid":"https://orcid.org/0000-0002-4106-9077"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"V.V. Vazirani","raw_affiliation_strings":["College of Computing Georgia Institute of Technology, Atlanta, GA, USA"],"affiliations":[{"raw_affiliation_string":"College of Computing Georgia Institute of Technology, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068195501","display_name":"G. Yuval","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"G. Yuval","raw_affiliation_strings":["Microsoft Research One Microsoft Way, Redmond, WA, USA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research One Microsoft Way, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5041706388"],"corresponding_institution_ids":["https://openalex.org/I1290206253"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.12292818,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"211","last_page":"211"},"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.9926999807357788,"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.9926999807357788,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9825999736785889,"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/unicast","display_name":"Unicast","score":0.8140551447868347},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.7710899114608765},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.765812337398529},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.708236813545227},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5625473260879517},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5597013831138611},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5468789935112},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5242710113525391},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5062752962112427},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.48886579275131226},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.45437145233154297},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4245205521583557},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.4224890470504761},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36414071917533875},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3422541618347168},{"id":"https://openalex.org/keywords/multicast","display_name":"Multicast","score":0.30249714851379395},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2600041329860687},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.07572263479232788}],"concepts":[{"id":"https://openalex.org/C11704745","wikidata":"https://www.wikidata.org/wiki/Q918337","display_name":"Unicast","level":3,"score":0.8140551447868347},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.7710899114608765},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.765812337398529},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.708236813545227},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5625473260879517},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5597013831138611},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5468789935112},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5242710113525391},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5062752962112427},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.48886579275131226},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45437145233154297},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4245205521583557},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.4224890470504761},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36414071917533875},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3422541618347168},{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.30249714851379395},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2600041329860687},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.07572263479232788},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itw.2006.1633813","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2006.1633813","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 IEEE Information Theory Workshop","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":0,"referenced_works":[],"related_works":["https://openalex.org/W2794998165","https://openalex.org/W2962934782","https://openalex.org/W1982696243","https://openalex.org/W2138841883","https://openalex.org/W2303790217","https://openalex.org/W1997326586","https://openalex.org/W2053449743","https://openalex.org/W2164280516","https://openalex.org/W1549943908","https://openalex.org/W2077883623"],"abstract_inverted_index":{"Li":[0,2],"and":[1],"conjectured":[3],"that":[4],"in":[5],"an":[6,70],"undirected":[7],"network":[8,13,36],"with":[9,43],"multiple":[10],"unicast":[11],"sessions,":[12],"coding":[14,20],"does":[15],"not":[16,29],"lead":[17],"to":[18,66],"any":[19],"gain.":[21],"Surprisingly":[22],"enough,":[23],"so":[24],"far":[25],"this":[26,60],"conjecture":[27,58],"could":[28],"be":[30],"verified":[31],"even":[32],"for":[33,59],"the":[34,52,56,67],"simple":[35],"consisting":[37],"of":[38,55,69],"K":[39],"<inf":[40],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[41],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">3,2</inf>":[42],"four":[44],"source-sink":[45],"pairs.":[46],"Using":[47],"entropy":[48],"calculus,":[49],"we":[50],"provide":[51],"first":[53],"verification":[54],"Li-Li":[57],"network.":[61,74],"We":[62],"extend":[63],"our":[64],"bound":[65],"case":[68],"arbitrary":[71],"directed":[72],"bipartite":[73]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}