{"id":"https://openalex.org/W1844644571","doi":"https://doi.org/10.1007/3-540-63385-5_30","title":"Alogtime algorithms for tree isomorphism, comparison, and canonization","display_name":"Alogtime algorithms for tree isomorphism, comparison, and canonization","publication_year":1997,"publication_date":"1997-01-01","ids":{"openalex":"https://openalex.org/W1844644571","doi":"https://doi.org/10.1007/3-540-63385-5_30","mag":"1844644571"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-63385-5_30","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-63385-5_30","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5103600441","display_name":"Samuel R. Buss","orcid":null},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Samuel R. Buss","raw_affiliation_strings":["Departments of Mathematics & Computer Science, Univ. of California, San Diego, 92093-0112, La Jolla, CA","University of California,  San Diego"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departments of Mathematics & Computer Science, Univ. of California, San Diego, 92093-0112, La Jolla, CA","institution_ids":["https://openalex.org/I36258959"]},{"raw_affiliation_string":"University of California,  San Diego","institution_ids":["https://openalex.org/I36258959"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5103600441"],"corresponding_institution_ids":["https://openalex.org/I36258959"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":65,"citation_normalized_percentile":{"value":0.13963415,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"18","last_page":"33"},"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.9995999932289124,"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.9995999932289124,"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.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/T11106","display_name":"Data Management and Algorithms","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/tree","display_name":"Tree (set theory)","score":0.7383456230163574},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.7198688983917236},{"id":"https://openalex.org/keywords/isomorphism","display_name":"Isomorphism (crystallography)","score":0.6683815717697144},{"id":"https://openalex.org/keywords/segment-tree","display_name":"Segment tree","score":0.5636350512504578},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.5295563340187073},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.523465096950531},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.4969797432422638},{"id":"https://openalex.org/keywords/gomory\u2013hu-tree","display_name":"Gomory\u2013Hu tree","score":0.4796041250228882},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4764431118965149},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.47038733959198},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.4679286479949951},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.4448184072971344},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43734002113342285},{"id":"https://openalex.org/keywords/range-tree","display_name":"Range tree","score":0.430704265832901},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4005231261253357},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3822939097881317},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.28322815895080566},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.08739271759986877}],"concepts":[{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.7383456230163574},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.7198688983917236},{"id":"https://openalex.org/C203436722","wikidata":"https://www.wikidata.org/wiki/Q902950","display_name":"Isomorphism (crystallography)","level":3,"score":0.6683815717697144},{"id":"https://openalex.org/C94557470","wikidata":"https://www.wikidata.org/wiki/Q2377385","display_name":"Segment tree","level":5,"score":0.5636350512504578},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.5295563340187073},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.523465096950531},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.4969797432422638},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.4796041250228882},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4764431118965149},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47038733959198},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.4679286479949951},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.4448184072971344},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43734002113342285},{"id":"https://openalex.org/C68775195","wikidata":"https://www.wikidata.org/wiki/Q818944","display_name":"Range tree","level":5,"score":0.430704265832901},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4005231261253357},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3822939097881317},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.28322815895080566},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.08739271759986877},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"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/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","level":1,"score":0.0},{"id":"https://openalex.org/C115624301","wikidata":"https://www.wikidata.org/wiki/Q895901","display_name":"Crystal structure","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/3-540-63385-5_30","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-63385-5_30","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.2.9648","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.9648","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://euclid.ucsd.edu/~sbuss/ResearchWeb/treeisomorphism/paper.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.43.1353","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.1353","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://euclid.ucsd.edu/pub/sbuss/research/treeisomorphism.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.75.8140","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.75.8140","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://euclid.ucsd.edu/~sbuss/ResearchWeb/treeisomorphism/paper.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W108777047","https://openalex.org/W1655990431","https://openalex.org/W1970629906","https://openalex.org/W2009571139","https://openalex.org/W2027501230","https://openalex.org/W2034777450","https://openalex.org/W2037233409","https://openalex.org/W2038247515","https://openalex.org/W2045160990","https://openalex.org/W2064710033","https://openalex.org/W2068638452","https://openalex.org/W2104952158","https://openalex.org/W4240781210","https://openalex.org/W4285719527","https://openalex.org/W4388289494"],"related_works":["https://openalex.org/W4244673516","https://openalex.org/W22108090","https://openalex.org/W1999216101","https://openalex.org/W2107381954","https://openalex.org/W2592730620","https://openalex.org/W2084831204","https://openalex.org/W2125650843","https://openalex.org/W2160466620","https://openalex.org/W2150475707","https://openalex.org/W2005450316"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":4}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}