{"id":"https://openalex.org/W1998756491","doi":"https://doi.org/10.1137/s0895480197323159","title":"Optimal Bounds for Matching Routing on Trees","display_name":"Optimal Bounds for Matching Routing on Trees","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W1998756491","doi":"https://doi.org/10.1137/s0895480197323159","mag":"1998756491"},"language":"en","primary_location":{"id":"doi:10.1137/s0895480197323159","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480197323159","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/A5012300835","display_name":"Louxin Zhang","orcid":"https://orcid.org/0000-0003-0260-824X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Louxin Zhang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5012300835"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9696,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.74152761,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"12","issue":"1","first_page":"64","last_page":"77"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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.9994999766349792,"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.9952999949455261,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9937000274658203,"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.7998018860816956},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7996090650558472},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.7081388235092163},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.6946970224380493},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5300445556640625},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5191942453384399},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4668959081172943},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.44180846214294434},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.41705700755119324},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4136985242366791},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.19976374506950378},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.12307441234588623},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.08919337391853333}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7998018860816956},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7996090650558472},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.7081388235092163},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.6946970224380493},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5300445556640625},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5191942453384399},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4668959081172943},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.44180846214294434},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.41705700755119324},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4136985242366791},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.19976374506950378},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12307441234588623},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.08919337391853333},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s0895480197323159","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480197323159","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.55.7588","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.7588","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://adenine.krdl.org.sg:8080/~lxzhang/papers/SiamDM.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2013854554","https://openalex.org/W2066732775","https://openalex.org/W2088744235","https://openalex.org/W2096825367"],"related_works":["https://openalex.org/W3161249280","https://openalex.org/W2267059662","https://openalex.org/W4388411807","https://openalex.org/W2364268683","https://openalex.org/W1519906715","https://openalex.org/W2594778474","https://openalex.org/W2478803962","https://openalex.org/W2944183083","https://openalex.org/W3169430512","https://openalex.org/W2037924346"],"abstract_inverted_index":{"The":[0],"permutation":[1,26],"routing":[2],"problem":[3,47],"is":[4],"studied":[5],"for":[6],"trees":[7],"under":[8],"the":[9],"matching":[10],"model.":[11],"By":[12],"introducing":[13],"a":[14],"novel":[15],"and":[16,51],"useful":[17],"(so-called)":[18],"caterpillar":[19],"tree":[20,30],"partition,":[21],"we":[22],"prove":[23],"that":[24],"any":[25],"on":[27],"an":[28,45],"n-node":[29],"(and":[31],"thus":[32],"graph)":[33],"can":[34],"be":[35],"routed":[36],"in":[37],"$\\frac{3}{2}n":[38],"+":[39],"O(\\log":[40],"n)$":[41],"steps.":[42],"This":[43],"answers":[44],"open":[46],"of":[48],"Alon,":[49],"Chung,":[50],"Graham":[52],"[":[53],"SIAM":[54],"J.":[55],"Discrete":[56],"Math.,":[57],"7":[58],"(1994),":[59],"pp.":[60],"516--530].":[61]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2014,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}