{"id":"https://openalex.org/W3094056446","doi":"https://doi.org/10.1109/tit.2020.3033168","title":"Directed Intersection Representations and the Information Content of Digraphs","display_name":"Directed Intersection Representations and the Information Content of Digraphs","publication_year":2020,"publication_date":"2020-10-22","ids":{"openalex":"https://openalex.org/W3094056446","doi":"https://doi.org/10.1109/tit.2020.3033168","mag":"3094056446"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2020.3033168","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2020.3033168","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","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/A5037977519","display_name":"Xujun Liu","orcid":"https://orcid.org/0000-0001-8995-959X"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xujun Liu","raw_affiliation_strings":["Department of Mathematics, University of Illinois at Urbana\u2013Champaign, Champaign, IL, USA"],"raw_orcid":"https://orcid.org/0000-0001-8995-959X","affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Illinois at Urbana\u2013Champaign, Champaign, IL, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083404824","display_name":"Roberto Assis Machado","orcid":"https://orcid.org/0000-0003-0282-0742"},"institutions":[{"id":"https://openalex.org/I181391015","display_name":"Universidade Estadual de Campinas (UNICAMP)","ror":"https://ror.org/04wffgt70","country_code":"BR","type":"education","lineage":["https://openalex.org/I181391015"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Roberto Assis Machado","raw_affiliation_strings":["Department of Mathematics, University of Campinas, Campinas, Brazil"],"raw_orcid":"https://orcid.org/0000-0003-0282-0742","affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Campinas, Campinas, Brazil","institution_ids":["https://openalex.org/I181391015"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084947882","display_name":"Olgica Milenkovi\u0107","orcid":"https://orcid.org/0000-0002-1871-4912"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Olgica Milenkovic","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Illinois at Urbana\u2013Champaign, Champaign, IL, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Illinois at Urbana\u2013Champaign, Champaign, IL, USA","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2763,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.63702899,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"67","issue":"1","first_page":"347","last_page":"357"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9969000220298767,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9939000010490417,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.9107763767242432},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7669004201889038},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.6557856202125549},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6502688527107239},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5971505045890808},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5950697660446167},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4995992183685303},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.48457229137420654},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4521106779575348},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4289032220840454},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3397405743598938},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2592962980270386}],"concepts":[{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.9107763767242432},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7669004201889038},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.6557856202125549},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6502688527107239},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5971505045890808},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5950697660446167},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4995992183685303},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.48457229137420654},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4521106779575348},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4289032220840454},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3397405743598938},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2592962980270386},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2020.3033168","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2020.3033168","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3281947392","display_name":null,"funder_award_id":"2015/11286-8","funder_id":"https://openalex.org/F4320320997","funder_display_name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo"},{"id":"https://openalex.org/G4950236403","display_name":null,"funder_award_id":"NSF CCF 15-26875","funder_id":"https://openalex.org/F4320320997","funder_display_name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo"}],"funders":[{"id":"https://openalex.org/F4320320997","display_name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","ror":"https://ror.org/02ddkpn78"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W122020994","https://openalex.org/W947400629","https://openalex.org/W1500940362","https://openalex.org/W2002906478","https://openalex.org/W2022704179","https://openalex.org/W2027952317","https://openalex.org/W2064280346","https://openalex.org/W2076753758","https://openalex.org/W2116453796","https://openalex.org/W2125869687","https://openalex.org/W2143474538","https://openalex.org/W2321467776","https://openalex.org/W2752765779","https://openalex.org/W2964127776","https://openalex.org/W6629921927"],"related_works":["https://openalex.org/W2082494488","https://openalex.org/W2998116189","https://openalex.org/W4299411867","https://openalex.org/W2054349495","https://openalex.org/W2081358954","https://openalex.org/W1778531840","https://openalex.org/W2554461497","https://openalex.org/W4255598955","https://openalex.org/W2146569528","https://openalex.org/W1998712144"],"abstract_inverted_index":{"Consider":[0],"a":[1,32,59,72,77,109],"directed":[2,73,87,97],"graph":[3],"(digraph)":[4],"in":[5],"which":[6],"vertices":[7,14],"are":[8,15,114],"assigned":[9],"color":[10,26,35,53],"sets,":[11],"and":[12,18,27,79,136],"two":[13],"connected":[16],"if":[17,20],"only":[19],"they":[21],"share":[22],"at":[23],"least":[24],"one":[25],"the":[28,38,44,49,52,68,96,101,118,127,133],"tail":[29],"vertex":[30,134],"has":[31],"strictly":[33],"smaller":[34],"set":[36],"than":[37],"head.":[39],"We":[40,91],"seek":[41],"to":[42,94,107],"determine":[43],"smallest":[45,102],"possible":[46],"size":[47],"of":[48,51,71,76,104,120,132],"union":[50],"sets":[54],"that":[55,81],"allows":[56],"for":[57,85],"such":[58],"digraph":[60],"representation.":[61],"To":[62],"address":[63],"this":[64],"problem,":[65],"we":[66,125],"introduce":[67,95],"new":[69],"notion":[70],"intersection":[74,98],"representation":[75],"digraph,":[78],"show":[80],"it":[82],"is":[83],"well-defined":[84],"all":[86],"acyclic":[88],"graphs":[89],"(DAGs).":[90],"then":[92],"proceed":[93],"number":[99,103],"(DIN),":[100],"colors":[105],"needed":[106],"represent":[108],"DAG.":[110],"Our":[111],"main":[112],"results":[113],"upper":[115],"bounds":[116],"on":[117,123],"DIN":[119],"DAGs":[121],"based":[122],"what":[124],"call":[126],"longest":[128],"terminal":[129],"path":[130],"decomposition":[131],"set,":[135],"constructive":[137],"lower":[138],"bounds.":[139]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}