{"id":"https://openalex.org/W1498990067","doi":"https://doi.org/10.1145/3088513","title":"Optimal Induced Universal Graphs and Adjacency Labeling for Trees","display_name":"Optimal Induced Universal Graphs and Adjacency Labeling for Trees","publication_year":2017,"publication_date":"2017-08-17","ids":{"openalex":"https://openalex.org/W1498990067","doi":"https://doi.org/10.1145/3088513","mag":"1498990067"},"language":"en","primary_location":{"id":"doi:10.1145/3088513","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3088513","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://arxiv.org/pdf/1504.02306","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034291253","display_name":"Stephen Alstrup","orcid":"https://orcid.org/0000-0001-7896-8386"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Stephen Alstrup","raw_affiliation_strings":["University of Copenhagen, Denmark"],"affiliations":[{"raw_affiliation_string":"University of Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043525193","display_name":"S\u00f8ren Dahlgaard","orcid":"https://orcid.org/0000-0003-2925-746X"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"S\u00f8ren Dahlgaard","raw_affiliation_strings":["University of Copenhagen, Denmark"],"affiliations":[{"raw_affiliation_string":"University of Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037911463","display_name":"Mathias B\u00e6k Tejs Knudsen","orcid":"https://orcid.org/0000-0001-5308-9609"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Mathias B\u00e6k Tejs Knudsen","raw_affiliation_strings":["University of Copenhagen, Denmark"],"affiliations":[{"raw_affiliation_string":"University of Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5034291253"],"corresponding_institution_ids":["https://openalex.org/I124055696"],"apc_list":null,"apc_paid":null,"fwci":1.6551,"has_fulltext":true,"cited_by_count":21,"citation_normalized_percentile":{"value":0.84667427,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"64","issue":"4","first_page":"1","last_page":"22"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9998999834060669,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9998999834060669,"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.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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9983000159263611,"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/adjacency-list","display_name":"Adjacency list","score":0.7469616532325745},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5478430390357971},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5370669960975647},{"id":"https://openalex.org/keywords/adjacency-matrix","display_name":"Adjacency matrix","score":0.4734508693218231},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4039238691329956},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3637356162071228},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2561725378036499}],"concepts":[{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.7469616532325745},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5478430390357971},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5370669960975647},{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.4734508693218231},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4039238691329956},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3637356162071228},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2561725378036499}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3088513","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3088513","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/107a8ba0-c140-4022-bc24-aa38db345f8d","is_oa":true,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/107a8ba0-c140-4022-bc24-aa38db345f8d","pdf_url":"http://arxiv.org/pdf/1504.02306","source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Alstrup , S , Dahlgaard , S & Knudsen , M B T 2017 , ' Optimal induced universal graphs and adjacency labeling for trees ' , Journal of the ACM , vol. 64 , no. 4 , 27 . https://doi.org/10.1145/3088513","raw_type":"article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/54927023-eb75-43d2-be96-40c0b696ecb6","is_oa":false,"landing_page_url":"https://curis.ku.dk/portal/da/publications/optimal-induced-universal-graphs-and-adjacency-labeling-for-trees(54927023-eb75-43d2-be96-40c0b696ecb6).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/107a8ba0-c140-4022-bc24-aa38db345f8d","is_oa":true,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/107a8ba0-c140-4022-bc24-aa38db345f8d","pdf_url":"http://arxiv.org/pdf/1504.02306","source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Alstrup , S , Dahlgaard , S & Knudsen , M B T 2017 , ' Optimal induced universal graphs and adjacency labeling for trees ' , Journal of the ACM , vol. 64 , no. 4 , 27 . https://doi.org/10.1145/3088513","raw_type":"article"},"sustainable_development_goals":[{"display_name":"Life in Land","id":"https://metadata.un.org/sdg/15","score":0.7300000190734863}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1498990067.pdf","grobid_xml":"https://content.openalex.org/works/W1498990067.grobid-xml"},"referenced_works_count":95,"referenced_works":["https://openalex.org/W137664942","https://openalex.org/W140456478","https://openalex.org/W356477583","https://openalex.org/W639947448","https://openalex.org/W999599142","https://openalex.org/W1537030075","https://openalex.org/W1543879246","https://openalex.org/W1560716145","https://openalex.org/W1587867115","https://openalex.org/W1594470187","https://openalex.org/W1597567432","https://openalex.org/W1605337124","https://openalex.org/W1744292857","https://openalex.org/W1760754504","https://openalex.org/W1965633932","https://openalex.org/W1981272925","https://openalex.org/W1983773246","https://openalex.org/W1985636891","https://openalex.org/W1987699222","https://openalex.org/W1990376056","https://openalex.org/W1993294649","https://openalex.org/W1994115477","https://openalex.org/W1996196886","https://openalex.org/W1996656009","https://openalex.org/W1997272082","https://openalex.org/W1997949020","https://openalex.org/W2002270599","https://openalex.org/W2002364208","https://openalex.org/W2006162221","https://openalex.org/W2011576985","https://openalex.org/W2014912500","https://openalex.org/W2017848317","https://openalex.org/W2018804864","https://openalex.org/W2020965855","https://openalex.org/W2023365186","https://openalex.org/W2025590344","https://openalex.org/W2025876682","https://openalex.org/W2033112846","https://openalex.org/W2034501275","https://openalex.org/W2035494495","https://openalex.org/W2042604558","https://openalex.org/W2045446569","https://openalex.org/W2046229991","https://openalex.org/W2050332379","https://openalex.org/W2051311803","https://openalex.org/W2051671786","https://openalex.org/W2052690504","https://openalex.org/W2053463486","https://openalex.org/W2053578961","https://openalex.org/W2054926432","https://openalex.org/W2060159282","https://openalex.org/W2060963839","https://openalex.org/W2063441479","https://openalex.org/W2064876674","https://openalex.org/W2077824753","https://openalex.org/W2081735788","https://openalex.org/W2083584217","https://openalex.org/W2086253307","https://openalex.org/W2087392134","https://openalex.org/W2087811943","https://openalex.org/W2093981583","https://openalex.org/W2094722858","https://openalex.org/W2096304547","https://openalex.org/W2115083710","https://openalex.org/W2116365500","https://openalex.org/W2119837203","https://openalex.org/W2125082389","https://openalex.org/W2127248062","https://openalex.org/W2128777897","https://openalex.org/W2151358465","https://openalex.org/W2151523609","https://openalex.org/W2153353483","https://openalex.org/W2153573559","https://openalex.org/W2155537964","https://openalex.org/W2158278958","https://openalex.org/W2163230849","https://openalex.org/W2167049470","https://openalex.org/W2247301512","https://openalex.org/W2275573407","https://openalex.org/W2319000796","https://openalex.org/W2413066628","https://openalex.org/W2478461887","https://openalex.org/W2478916630","https://openalex.org/W2586156068","https://openalex.org/W2963123599","https://openalex.org/W2963393443","https://openalex.org/W3047771155","https://openalex.org/W3102876231","https://openalex.org/W3142537066","https://openalex.org/W3161610145","https://openalex.org/W4213289662","https://openalex.org/W4242124034","https://openalex.org/W4254031789","https://openalex.org/W6605584219","https://openalex.org/W6626141462"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W4213150077","https://openalex.org/W2369410163","https://openalex.org/W2059018062","https://openalex.org/W2604585036","https://openalex.org/W2078477160","https://openalex.org/W1989103179","https://openalex.org/W1991172810","https://openalex.org/W125803343","https://openalex.org/W2153421018"],"abstract_inverted_index":{"In":[0],"this":[1],"article,":[2],"we":[3],"show":[4],"that":[5,18,52],"there":[6],"exists":[7],"a":[8,43,65,83],"graph":[9,44],"G":[10,29],"with":[11,45],"O":[12,46,88],"(":[13,47,67],"n":[14,22,48,55,68,86],")":[15,50,70],"nodes":[16,23,51],"such":[17,110],"any":[19],"forest":[20],"of":[21,28,42,58,73],"is":[24],"an":[25,100],"induced":[26],"subgraph":[27],".":[30],"Furthermore,":[31],"for":[32,92],"constant":[33],"arboricity":[34,59],"k":[35,49,60,69],",":[36],"the":[37,40],"result":[38],"implies":[39],"existence":[41],"contains":[53],"all":[54],"-node":[56],"graphs":[57],"as":[61,111],"node-induced":[62],"subgraphs,":[63],"matching":[64],"\u03a9":[66],"lower":[71],"bound":[72],"Alstrup":[74],"and":[75,116,118],"Rauhe.":[76],"Our":[77],"upper":[78],"bounds":[79],"are":[80],"obtained":[81],"through":[82],"log":[84],"2":[85],"+":[87],"(1)":[89],"labeling":[90],"scheme":[91],"adjacency":[93],"queries":[94],"in":[95],"forests.":[96],"We":[97],"hereby":[98],"solve":[99],"open":[101],"problem":[102],"being":[103],"raised":[104],"repeatedly":[105],"over":[106],"decades":[107],"by":[108],"authors":[109],"Kannan":[112],"et":[113],"al.,":[114],"Chung,":[115],"Fraigniaud":[117],"Korman.":[119]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":6}],"updated_date":"2026-03-16T09:10:04.655348","created_date":"2025-10-10T00:00:00"}