{"id":"https://openalex.org/W2097782835","doi":"https://doi.org/10.1007/s00453-012-9630-x","title":"Fast Polynomial-Space Algorithms Using Inclusion-Exclusion","display_name":"Fast Polynomial-Space Algorithms Using Inclusion-Exclusion","publication_year":2012,"publication_date":"2012-03-09","ids":{"openalex":"https://openalex.org/W2097782835","doi":"https://doi.org/10.1007/s00453-012-9630-x","mag":"2097782835"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-012-9630-x","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-012-9630-x","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-012-9630-x.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-012-9630-x.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068357631","display_name":"Jesper Nederlof","orcid":"https://orcid.org/0000-0003-1848-0076"},"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":"Jesper Nederlof","raw_affiliation_strings":["Department of Informatics, University of Bergen, PBOX 7803, 5020, Bergen, Norway","University of Bergen"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, PBOX 7803, 5020, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]},{"raw_affiliation_string":"University of Bergen","institution_ids":["https://openalex.org/I4432739"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5068357631"],"corresponding_institution_ids":["https://openalex.org/I4432739"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":{"value":2890,"currency":"USD","value_usd":2890},"fwci":4.8407,"has_fulltext":true,"cited_by_count":60,"citation_normalized_percentile":{"value":0.95563967,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":"65","issue":"4","first_page":"868","last_page":"884"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10374","display_name":"Advanced Graph Theory Research","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/T10829","display_name":"Interconnection Networks and Systems","score":0.9979000091552734,"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.9973999857902527,"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.7872611284255981},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7310255765914917},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6672399640083313},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.513640820980072},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5082314014434814},{"id":"https://openalex.org/keywords/star","display_name":"Star (game theory)","score":0.4890971779823303},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45226022601127625},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.4464591443538666},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4254627823829651}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7872611284255981},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7310255765914917},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6672399640083313},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.513640820980072},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5082314014434814},{"id":"https://openalex.org/C2780897414","wikidata":"https://www.wikidata.org/wiki/Q7600592","display_name":"Star (game theory)","level":2,"score":0.4890971779823303},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45226022601127625},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.4464591443538666},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4254627823829651},{"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/s00453-012-9630-x","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-012-9630-x","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-012-9630-x.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:782947","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=782947","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0178-4617","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:library.tue.nl:782947","is_oa":false,"landing_page_url":"http://repository.tue.nl/782947","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0178-4617","raw_type":"Article / Letter to the editor"}],"best_oa_location":{"id":"doi:10.1007/s00453-012-9630-x","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-012-9630-x","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-012-9630-x.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.6600000262260437}],"awards":[],"funders":[{"id":"https://openalex.org/F4320323299","display_name":"Norges Forskningsr\u00e5d","ror":"https://ror.org/00epmv149"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2097782835.pdf","grobid_xml":"https://content.openalex.org/works/W2097782835.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W716692","https://openalex.org/W1497895992","https://openalex.org/W1516297517","https://openalex.org/W1602078796","https://openalex.org/W1604283551","https://openalex.org/W1617085997","https://openalex.org/W1975286948","https://openalex.org/W1988642505","https://openalex.org/W1996668544","https://openalex.org/W2001868457","https://openalex.org/W2003753063","https://openalex.org/W2023638076","https://openalex.org/W2026416569","https://openalex.org/W2045326192","https://openalex.org/W2048068744","https://openalex.org/W2061138851","https://openalex.org/W2074359677","https://openalex.org/W2096833188","https://openalex.org/W2107351840","https://openalex.org/W2126436716","https://openalex.org/W2129628945","https://openalex.org/W2561675875"],"related_works":["https://openalex.org/W2082872574","https://openalex.org/W1987177025","https://openalex.org/W4301179398","https://openalex.org/W3099328339","https://openalex.org/W4286893801","https://openalex.org/W2382032469","https://openalex.org/W2487945693","https://openalex.org/W2095369952","https://openalex.org/W1966931974","https://openalex.org/W2149927264"],"abstract_inverted_index":{"Given":[0],"a":[1,18,36,47,85,107,120],"graph":[2],"with":[3,57,84],"n":[4],"vertices,":[5],"k":[6],"terminals":[7],"and":[8,25,54,81,112],"positive":[9],"integer":[10],"weights":[11],"not":[12],"larger":[13],"than":[14],"c,":[15],"we":[16,64,94],"compute":[17],"minimum":[19],"Steiner":[20],"Tree":[21,80,110],"in":[22,38],"$\\mathcal{O}^{\\star}(2^{k}c)$":[23],"time":[24],"$\\mathcal{O}^{\\star}(c)$":[26],"space,":[27],"where":[28],"the":[29,39,43,58,103,114],"$\\mathcal{O}^{\\star}$":[30],"notation":[31],"omits":[32],"terms":[33],"bounded":[34],"by":[35,45],"polynomial":[37,69,98],"input-size.":[40],"We":[41],"obtain":[42],"result":[44],"defining":[46],"generalization":[48],"of":[49,88,106,116,119],"walks,":[50,53],"called":[51],"branching":[52],"combining":[55],"it":[56],"Inclusion-Exclusion":[59],"technique.":[60],"Using":[61],"this":[62],"combination":[63],"also":[65,95],"give":[66],"$\\mathcal{O}^{\\star}(2^{n})$":[67],"-time":[68],"space":[70,99],"algorithms":[71,100],"for":[72,101],"Degree":[73],"Constrained":[74],"Spanning":[75,79],"Tree,":[76],"Maximum":[77],"Internal":[78],"#Spanning":[82],"Forest":[83],"given":[86],"number":[87,115],"components.":[89],"Furthermore,":[90],"using":[91],"related":[92],"techniques,":[93],"present":[96],"new":[97],"computing":[102],"Cover":[104],"Polynomial":[105],"graph,":[108],"Convex":[109],"Coloring":[111],"counting":[113],"perfect":[117],"matchings":[118],"graph.":[121]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":3}],"updated_date":"2026-07-31T08:31:51.225901","created_date":"2025-10-10T00:00:00"}