{"id":"https://openalex.org/W2975673452","doi":"https://doi.org/10.1109/isit.2019.8849253","title":"Directed Intersection Representations and the Information Content of Digraphs","display_name":"Directed Intersection Representations and the Information Content of Digraphs","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W2975673452","doi":"https://doi.org/10.1109/isit.2019.8849253","mag":"2975673452"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2019.8849253","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849253","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Symposium on Information Theory (ISIT)","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/A5080894223","display_name":"Alexandr Kostochka","orcid":"https://orcid.org/0000-0002-6363-3804"},"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":true,"raw_author_name":"Alexandr V. Kostochka","raw_affiliation_strings":["Department of Mathematics, University of Illinois, Urbana-Champaign Urbana, Illinois, 61801","Department of Mathematics, University of Illinois, Urbana-Champaign Urbana, Illinois"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Illinois, Urbana-Champaign Urbana, Illinois, 61801","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Department of Mathematics, University of Illinois, Urbana-Champaign Urbana, Illinois","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"middle","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, Urbana-Champaign Urbana, Illinois, 61801","Department of Mathematics, University of Illinois, Urbana-Champaign Urbana, Illinois"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Illinois, Urbana-Champaign Urbana, Illinois, 61801","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Department of Mathematics, University of Illinois, Urbana-Champaign Urbana, Illinois","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/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":"Roberto Machado","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Illinois, Urbana-Champaign Urbana, Illinois, 61808"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Illinois, Urbana-Champaign Urbana, Illinois, 61808","institution_ids":["https://openalex.org/I157725225"]}]},{"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, Urbana-Champaign Urbana, Illinois, 61808"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Illinois, Urbana-Champaign Urbana, Illinois, 61808","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5080894223"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":0.3992,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.65618145,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1477","last_page":"1481"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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.9979000091552734,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9973999857902527,"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/digraph","display_name":"Digraph","score":0.9388911724090576},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.7880576848983765},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7424725890159607},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.6551384329795837},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6489408016204834},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.5762732625007629},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5411697030067444},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5135881900787354},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4928591251373291},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.49223247170448303},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.44203755259513855},{"id":"https://openalex.org/keywords/counterexample","display_name":"Counterexample","score":0.42009466886520386},{"id":"https://openalex.org/keywords/feedback-arc-set","display_name":"Feedback arc set","score":0.4128091633319855},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38306689262390137},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36634087562561035},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3223126530647278},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.11497160792350769}],"concepts":[{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.9388911724090576},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.7880576848983765},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7424725890159607},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.6551384329795837},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6489408016204834},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.5762732625007629},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5411697030067444},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5135881900787354},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4928591251373291},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.49223247170448303},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.44203755259513855},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.42009466886520386},{"id":"https://openalex.org/C157951044","wikidata":"https://www.wikidata.org/wiki/Q1400910","display_name":"Feedback arc set","level":5,"score":0.4128091633319855},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38306689262390137},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36634087562561035},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3223126530647278},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.11497160792350769},{"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/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"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/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","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},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2019.8849253","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849253","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Symposium on Information Theory (ISIT)","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":10,"referenced_works":["https://openalex.org/W122020994","https://openalex.org/W947400629","https://openalex.org/W2002906478","https://openalex.org/W2064280346","https://openalex.org/W2076753758","https://openalex.org/W2116453796","https://openalex.org/W2125869687","https://openalex.org/W2321467776","https://openalex.org/W2964127776","https://openalex.org/W6891850700"],"related_works":["https://openalex.org/W1778531840","https://openalex.org/W2107228433","https://openalex.org/W4214487273","https://openalex.org/W4236436085","https://openalex.org/W4287028074","https://openalex.org/W2354764436","https://openalex.org/W3191289342","https://openalex.org/W4255598955","https://openalex.org/W4297817344","https://openalex.org/W2555805899"],"abstract_inverted_index":{"Consider":[0],"a":[1,31,65,70,109],"directed":[2,66,80,90],"graph":[3],"(digraph)":[4],"in":[5],"which":[6],"two":[7],"user":[8],"vertices":[9],"are":[10],"connected":[11,148],"if":[12,15],"and":[13,26,72,150],"only":[14],"they":[16],"share":[17],"at":[18],"least":[19],"one":[20],"unit":[21],"of":[22,64,69,97,117,126,137,147],"common":[23],"information":[24,46,98],"content":[25,34,47],"the":[27,36,42,51,61,89,94,103,114,121,127,134,138],"head":[28],"vertex":[29,128],"has":[30],"strictly":[32],"smaller":[33],"than":[35],"tail.":[37],"We":[38,84],"seek":[39],"to":[40,87,101],"estimate":[41],"smallest":[43,95],"possible":[44],"global":[45],"that":[48,74,153],"can":[49],"explain":[50],"observed":[52],"digraph":[53],"topology.":[54],"To":[55],"address":[56],"this":[57],"problem,":[58],"we":[59,132],"introduce":[60],"new":[62],"notion":[63],"intersection":[67,91],"representation":[68],"digraph,":[71],"show":[73],"it":[75],"is":[76,108],"well-defined":[77],"for":[78,141],"all":[79],"acyclic":[81],"graphs":[82],"(DAGs).":[83],"then":[85],"proceed":[86],"describe":[88],"number":[92,96,116,140],"(DIN),":[93],"units":[99],"needed":[100],"represent":[102],"DAG.":[104],"Our":[105],"main":[106],"result":[107],"nontrivial":[110],"upper":[111],"bound":[112],"on":[113,120],"DIN":[115,139,156],"DAGs":[118,149],"based":[119],"longest":[122],"terminal":[123],"path":[124],"decomposition":[125],"set.":[129],"In":[130],"addition,":[131],"compute":[133],"exact":[135],"values":[136],"several":[142],"simple":[143],"yet":[144],"relevant":[145],"families":[146],"construct":[151],"digraphs":[152],"have":[154],"near-optimal":[155],"values.":[157]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-03-25T13:04:00.132906","created_date":"2025-10-10T00:00:00"}