{"id":"https://openalex.org/W2509853148","doi":"https://doi.org/10.4204/eptcs.225.5","title":"Kruskal's Tree Theorem for Acyclic Term Graphs","display_name":"Kruskal's Tree Theorem for Acyclic Term Graphs","publication_year":2016,"publication_date":"2016-09-10","ids":{"openalex":"https://openalex.org/W2509853148","doi":"https://doi.org/10.4204/eptcs.225.5","mag":"2509853148"},"language":"en","primary_location":{"id":"doi:10.4204/eptcs.225.5","is_oa":true,"landing_page_url":"https://doi.org/10.4204/eptcs.225.5","pdf_url":"https://arxiv.org/pdf/1609.03642","source":{"id":"https://openalex.org/S4210216316","display_name":"Electronic Proceedings in Theoretical Computer Science","issn_l":"2075-2180","issn":["2075-2180"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310318029","host_organization_name":"Open Publishing Association","host_organization_lineage":["https://openalex.org/P4310318029"],"host_organization_lineage_names":["Open Publishing Association"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Proceedings in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://arxiv.org/pdf/1609.03642","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050172197","display_name":"Georg Moser","orcid":"https://orcid.org/0000-0001-9240-6128"},"institutions":[{"id":"https://openalex.org/I190249584","display_name":"Universit\u00e4t Innsbruck","ror":"https://ror.org/054pv6659","country_code":"AT","type":"education","lineage":["https://openalex.org/I190249584"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Georg Moser","raw_affiliation_strings":["Universit\u00e4t Innsbruck, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Innsbruck, Austria","institution_ids":["https://openalex.org/I190249584"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038964988","display_name":"Maria A. Schett","orcid":"https://orcid.org/0000-0003-2919-5983"},"institutions":[{"id":"https://openalex.org/I190249584","display_name":"Universit\u00e4t Innsbruck","ror":"https://ror.org/054pv6659","country_code":"AT","type":"education","lineage":["https://openalex.org/I190249584"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Maria A. Schett","raw_affiliation_strings":["Universit\u00e4t Innsbruck, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Innsbruck, Austria","institution_ids":["https://openalex.org/I190249584"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.08964342,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"225","issue":null,"first_page":"25","last_page":"34"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9930999875068665,"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/T10142","display_name":"Formal Methods in Verification","score":0.9930999875068665,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9909999966621399,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9886999726295471,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.7297699451446533},{"id":"https://openalex.org/keywords/term","display_name":"Term (time)","score":0.7183359265327454},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6066791415214539},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5487542748451233},{"id":"https://openalex.org/keywords/rewriting","display_name":"Rewriting","score":0.5384248495101929},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5356212854385376},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4466005563735962},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.43370410799980164},{"id":"https://openalex.org/keywords/lexicographical-order","display_name":"Lexicographical order","score":0.43123096227645874},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2698456048965454}],"concepts":[{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.7297699451446533},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.7183359265327454},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6066791415214539},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5487542748451233},{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.5384248495101929},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5356212854385376},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4466005563735962},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.43370410799980164},{"id":"https://openalex.org/C159254197","wikidata":"https://www.wikidata.org/wiki/Q1144915","display_name":"Lexicographical order","level":2,"score":0.43123096227645874},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2698456048965454},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.4204/eptcs.225.5","is_oa":true,"landing_page_url":"https://doi.org/10.4204/eptcs.225.5","pdf_url":"https://arxiv.org/pdf/1609.03642","source":{"id":"https://openalex.org/S4210216316","display_name":"Electronic Proceedings in Theoretical Computer Science","issn_l":"2075-2180","issn":["2075-2180"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310318029","host_organization_name":"Open Publishing Association","host_organization_lineage":["https://openalex.org/P4310318029"],"host_organization_lineage_names":["Open Publishing Association"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Proceedings in Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1609.03642","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1609.03642","pdf_url":"https://arxiv.org/pdf/1609.03642","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:doaj.org/article:e0d1b67513214889a6ebac55cde2d74c","is_oa":true,"landing_page_url":"https://doaj.org/article/e0d1b67513214889a6ebac55cde2d74c","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Electronic Proceedings in Theoretical Computer Science, Vol 225, Iss Proc. TERMGRAPH 2016, Pp 25-34 (2016)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.4204/eptcs.225.5","is_oa":true,"landing_page_url":"https://doi.org/10.4204/eptcs.225.5","pdf_url":"https://arxiv.org/pdf/1609.03642","source":{"id":"https://openalex.org/S4210216316","display_name":"Electronic Proceedings in Theoretical Computer Science","issn_l":"2075-2180","issn":["2075-2180"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310318029","host_organization_name":"Open Publishing Association","host_organization_lineage":["https://openalex.org/P4310318029"],"host_organization_lineage_names":["Open Publishing Association"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Proceedings in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2106173989","display_name":null,"funder_award_id":"P 25781-N15","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G3520111107","display_name":"Automated Complexity Analysis via Transformations","funder_award_id":"P 25781","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2509853148.pdf","grobid_xml":"https://content.openalex.org/works/W2509853148.grobid-xml"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W108605113","https://openalex.org/W148448369","https://openalex.org/W647806872","https://openalex.org/W1557619244","https://openalex.org/W1629743385","https://openalex.org/W1778517814","https://openalex.org/W1788078288","https://openalex.org/W2018765574","https://openalex.org/W2020692742","https://openalex.org/W2076508310","https://openalex.org/W2086747974","https://openalex.org/W2099473324","https://openalex.org/W2109883071","https://openalex.org/W2115215132","https://openalex.org/W2116134765","https://openalex.org/W2125223606","https://openalex.org/W2154286698","https://openalex.org/W2163841074","https://openalex.org/W2463218253","https://openalex.org/W2538926940","https://openalex.org/W4240833632","https://openalex.org/W4251084952","https://openalex.org/W4297595353","https://openalex.org/W6729056238"],"related_works":["https://openalex.org/W1993634787","https://openalex.org/W3125614403","https://openalex.org/W2476923378","https://openalex.org/W2120204135","https://openalex.org/W3100240142","https://openalex.org/W2139396251","https://openalex.org/W2803221307","https://openalex.org/W1796293478","https://openalex.org/W1577544887","https://openalex.org/W2486717996"],"abstract_inverted_index":{"In":[0,51,78],"this":[1,41],"paper":[2],"we":[3,11,25,42,65,80,96],"study":[4],"termination":[5],"of":[6,30,33,69,86,100],"term":[7,17,38,49,76,107],"graph":[8],"rewriting,":[9],"where":[10],"restrict":[12],"our":[13,56],"attention":[14],"to":[15,48,53],"acyclic":[16,37,75,106],"graphs.":[18,39,50,77,108],"Motivated":[19],"by":[20,23,60],"earlier":[21,54],"work":[22],"Plump":[24],"aim":[26],"at":[27],"a":[28,67,98],"definition":[29],"the":[31,44,83,101],"notion":[32,57,85],"simplification":[34],"order":[35,104],"for":[36,74,105],"For":[40],"adapt":[43],"homeomorphic":[45],"embedding":[46,87],"relation":[47],"contrast":[52],"extensions,":[55],"is":[58],"inspired":[59],"morphisms.":[61],"Based":[62],"on":[63,82],"this,":[64],"establish":[66],"variant":[68,99],"Kruskal's":[70],"Tree":[71],"Theorem":[72],"formulated":[73],"proof,":[79],"rely":[81],"new":[84],"and":[88],"follow":[89],"Nash-Williams'":[90],"minimal":[91],"bad":[92],"sequence":[93],"argument.":[94],"Finally,":[95],"propose":[97],"lexicographic":[102],"path":[103]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}