{"id":"https://openalex.org/W7723479","doi":null,"title":"Approximation Algorithms for the Largest Common Subtree Problem.","display_name":"Approximation Algorithms for the Largest Common Subtree Problem.","publication_year":1995,"publication_date":"1995-02-01","ids":{"openalex":"https://openalex.org/W7723479","mag":"7723479"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.41.4833","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.4833","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cis.upenn.edu/~cisfac/sanjeev/postscript/lcst.ps.gz","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5039619350","display_name":"Sanjeev Khanna","orcid":"https://orcid.org/0009-0000-2601-1689","observed_orcids":["https://orcid.org/0009-0000-2601-1689"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sanjeev Khanna","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0009-0000-2601-1689","affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112649653","display_name":"Rajeev Motwani","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rajeev Motwani","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5102463516","display_name":"Frances Yao","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Frances Yao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.5667,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.78934555,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":93},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9878000020980835,"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.9878000020980835,"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/T11269","display_name":"Algorithms and Data Compression","score":0.005200000014156103,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.0035000001080334187,"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/approximation-algorithms","display_name":"approximation algorithms","score":0.7609999775886536},{"id":"https://openalex.org/keywords/trees","display_name":"trees","score":0.8259999752044678},{"id":"https://openalex.org/keywords/bounded-degree-trees","display_name":"bounded degree trees","score":0.9160000085830688},{"id":"https://openalex.org/keywords/labeled-trees","display_name":"labeled trees","score":0.9559999704360962},{"id":"https://openalex.org/keywords/approximation-ratio","display_name":"approximation ratio","score":0.7350000143051147},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"graph isomorphism","score":0.5619999766349792}],"concepts":[{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.811440646648407},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7357670068740845},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7149577736854553},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6313009262084961},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5673985481262207},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4944772720336914},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.48037204146385193},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46113455295562744},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.06733283400535583},{"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/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.41.4833","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.4833","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cis.upenn.edu/~cisfac/sanjeev/postscript/lcst.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.52.2277","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.52.2277","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://theory.stanford.edu/people/motwani/postscripts/lcst.ps.gz","raw_type":"text"},{"id":"mag:7723479","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=892569","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2076999762","https://openalex.org/W2054729486","https://openalex.org/W2081773626","https://openalex.org/W226858332","https://openalex.org/W1514401476","https://openalex.org/W7124210088","https://openalex.org/W4321365133","https://openalex.org/W7018125909","https://openalex.org/W3036952818","https://openalex.org/W7138832765"],"abstract_inverted_index":{"The":[0],"largest":[1,9,32],"common":[2,15],"subtree":[3],"problem":[4],"is":[5,48,98,115],"to":[6,50],"find":[7],"a":[8,14,18],"tree":[10,33],"which":[11],"occurs":[12],"as":[13],"subgraph":[16],"in":[17,30,34,40],"given":[19],"collection":[20],"of":[21,28,43,55,89,104,112],"trees.":[22],"Let":[23],"n":[24],"denote":[25],"the":[26,31,35,41,82,102,110],"number":[27,111],"vertices":[29],"collection.":[36],"We":[37],"show":[38],"that":[39],"case":[42,103],"bounded":[44],"degree":[45,64,107],"trees,":[46,65],"it":[47],"possible":[49],"achieve":[51],"an":[52,68],"approximation":[53,71,87],"ratio":[54,72,88],"O(n(log":[56,73,90],"log":[57,59,74,78,91,95],"n)=":[58],"2":[60,76,79,93,96],"n).":[61,118],"For":[62],"unbounded":[63,106],"we":[66],"give":[67],"algorithm":[69],"with":[70],"n)":[75,80,92,97],"=":[77,94],"when":[81],"trees":[83,108],"are":[84],"unlabeled.":[85],"An":[86],"also":[99],"achieved":[100],"for":[101],"labeled":[105],"provided":[109],"distinct":[113],"labels":[114],"O(log":[116],"O(1)":[117]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2016-06-24T00:00:00"}