{"id":"https://openalex.org/W1650040599","doi":"https://doi.org/10.1007/bfb0054370","title":"Memory requirements for table computations in partial k-tree algorithms","display_name":"Memory requirements for table computations in partial k-tree algorithms","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W1650040599","doi":"https://doi.org/10.1007/bfb0054370","mag":"1650040599"},"language":"en","primary_location":{"id":"doi:10.1007/bfb0054370","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bfb0054370","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":"book-chapter","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/A5034298677","display_name":"Bengt Aspvall","orcid":null},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":true,"raw_author_name":"Bengt Aspvall","raw_affiliation_strings":["Department of Informatics, University of Bergen, Norway","University of Bergen"],"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]},{"raw_affiliation_string":"University of Bergen","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082277472","display_name":"Andrzej Proskurowski","orcid":null},"institutions":[{"id":"https://openalex.org/I181233156","display_name":"University of Oregon","ror":"https://ror.org/0293rh119","country_code":"US","type":"education","lineage":["https://openalex.org/I181233156"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrzej Proskurowski","raw_affiliation_strings":["CIS Department, University of Oregon, USA","University of Oregon"],"affiliations":[{"raw_affiliation_string":"CIS Department, University of Oregon, USA","institution_ids":["https://openalex.org/I181233156"]},{"raw_affiliation_string":"University of Oregon","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019858728","display_name":"Jan Arne Telle","orcid":"https://orcid.org/0000-0002-9429-5377"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Jan Arne Telle","raw_affiliation_strings":["Department of Informatics, University of Bergen, Norway","University of Bergen"],"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]},{"raw_affiliation_string":"University of Bergen","institution_ids":["https://openalex.org/I4432739"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5034298677"],"corresponding_institution_ids":["https://openalex.org/I4432739"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.0106,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.75047046,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"222","last_page":"233"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9991000294685364,"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.9991000294685364,"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.9980999827384949,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9979000091552734,"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/treewidth","display_name":"Treewidth","score":0.8191443681716919},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.8051966428756714},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.7308670878410339},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6065735816955566},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.5302574038505554},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49498599767684937},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.49053043127059937},{"id":"https://openalex.org/keywords/tree-depth","display_name":"Tree-depth","score":0.487371027469635},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.46957799792289734},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4584490954875946},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45411327481269836},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.4537012279033661},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44599229097366333},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36406874656677246},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3318425416946411},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.06724831461906433}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.8191443681716919},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.8051966428756714},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.7308670878410339},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6065735816955566},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.5302574038505554},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49498599767684937},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.49053043127059937},{"id":"https://openalex.org/C69284658","wikidata":"https://www.wikidata.org/wiki/Q7837500","display_name":"Tree-depth","level":5,"score":0.487371027469635},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.46957799792289734},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4584490954875946},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45411327481269836},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.4537012279033661},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44599229097366333},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36406874656677246},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3318425416946411},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.06724831461906433},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/bfb0054370","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bfb0054370","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.21.9242","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.9242","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ii.uib.no/~telle/bib/APT.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.32.5209","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.5209","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.uoregon.edu/~andrzej/pubs/mem.ps","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":14,"referenced_works":["https://openalex.org/W1834576908","https://openalex.org/W1989556004","https://openalex.org/W2015469394","https://openalex.org/W2019589107","https://openalex.org/W2024291212","https://openalex.org/W2033405938","https://openalex.org/W2057839002","https://openalex.org/W2067264828","https://openalex.org/W2076322499","https://openalex.org/W2096882055","https://openalex.org/W2153362081","https://openalex.org/W2729466647","https://openalex.org/W2986773320","https://openalex.org/W6605708452"],"related_works":["https://openalex.org/W1836127928","https://openalex.org/W2027388354","https://openalex.org/W1490290385","https://openalex.org/W1539278744","https://openalex.org/W1973972417","https://openalex.org/W2084535634","https://openalex.org/W1572255008","https://openalex.org/W2584271047","https://openalex.org/W2949315077","https://openalex.org/W2186377788"],"abstract_inverted_index":null,"counts_by_year":[{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}