{"id":"https://openalex.org/W68452509","doi":"https://doi.org/10.1007/978-1-4615-3422-8_31","title":"Parallel Algorithms for NP-Complete Problems","display_name":"Parallel Algorithms for NP-Complete Problems","alternate_titles":[],"publication_year":1992,"publication_date":"1992-01-01","ids":{"openalex":"https://openalex.org/W68452509","doi":"https://doi.org/10.1007/978-1-4615-3422-8_31","mag":"68452509"},"language":"en","primary_location":{"id":"doi:10.1007/978-1-4615-3422-8_31","doi":"https://doi.org/10.1007/978-1-4615-3422-8_31","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-1-4615-3422-8_31","pdf_url":null,"source":{"id":"https://openalex.org/S4306463937","display_name":"Springer eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computer Science","raw_type":"book-chapter"},"parent_works":[{"id":"https://openalex.org/W4245871956","display_name":"Computer Science: Research and Applications","relationship":"volume"}],"lineage":["https://openalex.org/W68452509","https://openalex.org/W4245871956"],"child_works_count":0,"type":"book-chapter","is_traditional":true,"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/A5008889141","display_name":"John Michael Robson","orcid":"https://orcid.org/0000-0002-4332-6524","observed_orcids":["https://orcid.org/0000-0002-4332-6524"]},"institutions":[{"id":"https://openalex.org/I118347636","display_name":"Australian National University","ror":"https://ror.org/019wvm592","country_code":"AU","type":"education","lineage":["https://openalex.org/I118347636"]}],"countries":["AU"],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"J. M. Robson","raw_affiliation_strings":["Australian National University, GPO Box 4, Canberra, ACT 2601, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Australian National University, GPO Box 4, Canberra, ACT 2601, Australia","institution_ids":["https://openalex.org/I118347636"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5008889141"],"corresponding_institution_ids":["https://openalex.org/I118347636"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"379","last_page":"382"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9531000256538391,"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.9531000256538391,"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.026599999517202377,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.0032999999821186066,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/np-complete-problems","display_name":"NP-complete problems","score":0.925000011920929},{"id":"https://openalex.org/keywords/parallel-algorithms","display_name":"parallel algorithms","score":0.9990000128746033},{"id":"https://openalex.org/keywords/intractability","display_name":"computational intractability","score":0.6859999895095825},{"id":"https://openalex.org/keywords/exponential-time-algorithms","display_name":"exponential-time algorithms","score":0.6010000109672546},{"id":"https://openalex.org/keywords/subexponential-algorithms","display_name":"subexponential algorithms","score":0.7440000176429749},{"id":"https://openalex.org/keywords/parallel-machines","display_name":"parallel machines","score":0.5120000243186951},{"id":"https://openalex.org/keywords/combinatorial-search","display_name":"combinatorial search","score":0.5019999742507935}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7798799276351929},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7202594876289368},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.6062678694725037},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.5077970623970032},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46810150146484375},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39998674392700195},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3844704031944275},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18090978264808655},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-1-4615-3422-8_31","doi":"https://doi.org/10.1007/978-1-4615-3422-8_31","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-1-4615-3422-8_31","pdf_url":null,"source":{"id":"https://openalex.org/S4306463937","display_name":"Springer eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W41104307","https://openalex.org/W434863569","https://openalex.org/W1984481156","https://openalex.org/W1985449594","https://openalex.org/W1995067748","https://openalex.org/W2016042296","https://openalex.org/W2042654457","https://openalex.org/W2050917944"],"related_works":["https://openalex.org/W2482809552","https://openalex.org/W4234604150","https://openalex.org/W2991981401","https://openalex.org/W434863569","https://openalex.org/W107119796","https://openalex.org/W2302602544","https://openalex.org/W1548804402","https://openalex.org/W1523311306","https://openalex.org/W2487751128","https://openalex.org/W943626823"],"abstract_inverted_index":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W68452509","counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2016-06-24T00:00:00"}
