{"id":"https://openalex.org/W1997412986","doi":"https://doi.org/10.1137/130932946","title":"On-Line Vertex Ranking of Trees","display_name":"On-Line Vertex Ranking of Trees","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W1997412986","doi":"https://doi.org/10.1137/130932946","mag":"1997412986"},"language":"en","primary_location":{"id":"doi:10.1137/130932946","is_oa":false,"landing_page_url":"https://doi.org/10.1137/130932946","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","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/A5108729334","display_name":"Daniel C. McDonald","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Daniel C. McDonald","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5108729334"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7446,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.73257322,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"29","issue":"1","first_page":"145","last_page":"156"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10374","display_name":"Advanced Graph Theory Research","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991999864578247,"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.9980999827384949,"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/combinatorics","display_name":"Combinatorics","score":0.836444616317749},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6745941638946533},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6741403341293335},{"id":"https://openalex.org/keywords/ranking","display_name":"Ranking (information retrieval)","score":0.6403224468231201},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4495828449726105},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.43864336609840393},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42083412408828735},{"id":"https://openalex.org/keywords/bound-graph","display_name":"Bound graph","score":0.4189332127571106},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4160580635070801},{"id":"https://openalex.org/keywords/path-graph","display_name":"Path graph","score":0.41234898567199707},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2581367492675781},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2173110842704773},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.15177175402641296},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11362692713737488}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.836444616317749},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6745941638946533},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6741403341293335},{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.6403224468231201},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4495828449726105},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.43864336609840393},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42083412408828735},{"id":"https://openalex.org/C121134508","wikidata":"https://www.wikidata.org/wiki/Q4949882","display_name":"Bound graph","level":5,"score":0.4189332127571106},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4160580635070801},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.41234898567199707},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2581367492675781},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2173110842704773},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.15177175402641296},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11362692713737488},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/130932946","is_oa":false,"landing_page_url":"https://doi.org/10.1137/130932946","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W198812637","https://openalex.org/W1503877541","https://openalex.org/W1978719437","https://openalex.org/W1982793783","https://openalex.org/W1997263006","https://openalex.org/W2013977596","https://openalex.org/W2025800297","https://openalex.org/W2029465292","https://openalex.org/W2052210031","https://openalex.org/W2053369727","https://openalex.org/W2062037518","https://openalex.org/W2070040189","https://openalex.org/W2076856026","https://openalex.org/W2081118695","https://openalex.org/W2082764577","https://openalex.org/W2084182857","https://openalex.org/W2112505974","https://openalex.org/W2152330932","https://openalex.org/W2396781784","https://openalex.org/W4248401037"],"related_works":["https://openalex.org/W3033929256","https://openalex.org/W2329993079","https://openalex.org/W2937406279","https://openalex.org/W4247701251","https://openalex.org/W2077631478","https://openalex.org/W4289285859","https://openalex.org/W2901484702","https://openalex.org/W2349332978","https://openalex.org/W4250290902","https://openalex.org/W4382361774"],"abstract_inverted_index":{"A":[0],"$k$-ranking":[1,37],"of":[2,9,42,49,71,84,105,118,127,147,151,157],"a":[3,7,26,36,79],"graph":[4],"$G$":[5,34,72,85,110,119],"is":[6,38,111,120],"labeling":[8],"its":[10,99],"vertices":[11,70,89],"from":[12],"$\\{1,\\ldots,k\\}$":[13],"such":[14,125],"that":[15,131],"any":[16],"nontrivial":[17],"path":[18],"whose":[19],"endpoints":[20],"have":[21],"the":[22,39,69,82,88,102,106,121,128,143],"same":[23],"label":[24,130],"contains":[25],"larger":[27],"label.":[28],"The":[29,59,114],"least":[30],"$k$":[31],"for":[32,64],"which":[33],"has":[35],"ranking":[40,61,116,145],"number":[41,117,146,156],"$G$,":[43],"also":[44],"known":[45],"as":[46,73],"tree-depth.":[47],"Applications":[48],"rankings":[50],"include":[51],"VLSI":[52],"design,":[53],"parallel":[54],"computing,":[55],"and":[56,155],"factory":[57],"scheduling.":[58],"on-line":[60,115,144],"problem":[62],"asks":[63],"an":[65],"algorithm":[66,132],"to":[67,136],"rank":[68],"they":[74],"are":[75],"revealed":[76,90,95],"one":[77],"at":[78],"time":[80],"in":[81,109,149],"subgraph":[83,108],"induced":[86,107],"by":[87],"so":[91],"far":[92],"(each":[93],"previously":[94],"vertex":[96],"appears":[97],"with":[98],"label,":[100],"but":[101],"final":[103],"placement":[104],"not":[112],"specified).":[113],"minimum":[122],"over":[123],"all":[124],"algorithms":[126],"largest":[129],"can":[133],"be":[134],"forced":[135],"use.":[137],"We":[138],"give":[139],"algorithmic":[140],"bounds":[141],"on":[142],"trees":[148],"terms":[150],"maximum":[152],"degree,":[153],"diameter,":[154],"internal":[158],"vertices.":[159]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}