{"id":"https://openalex.org/W2016000144","doi":"https://doi.org/10.1016/0020-0190(74)90001-5","title":"A structured program to generate all topological sorting arrangements","display_name":"A structured program to generate all topological sorting arrangements","publication_year":1974,"publication_date":"1974-04-01","ids":{"openalex":"https://openalex.org/W2016000144","doi":"https://doi.org/10.1016/0020-0190(74)90001-5","mag":"2016000144"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(74)90001-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(74)90001-5","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"},"type":"article","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/A5110826490","display_name":"Donald E. Knuth","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Donald E. Knuth","raw_affiliation_strings":["Computer Science Dept., Stanford University, Stanford, Calif., 94305, USA","Computer Science Department, Stanford University, Stanford, Calif. 94305, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science Dept., Stanford University, Stanford, Calif., 94305, USA","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Computer Science Department, Stanford University, Stanford, Calif. 94305, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004984970","display_name":"Jayme L. Szwarcfiter","orcid":"https://orcid.org/0000-0002-7538-7305"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jayme L. Szwarcfiter","raw_affiliation_strings":["Universidade Federal do Rio de Janeiro, Argentina"],"affiliations":[{"raw_affiliation_string":"Universidade Federal do Rio de Janeiro, Argentina","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5110826490"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":2.0847,"has_fulltext":false,"cited_by_count":96,"citation_normalized_percentile":{"value":0.86410835,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"2","issue":"6","first_page":"153","last_page":"157"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9907000064849854,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9907000064849854,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11159","display_name":"Manufacturing Process and Optimization","score":0.986299991607666,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11053","display_name":"Process Optimization and Integration","score":0.9833999872207642,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.7172583341598511},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6398013234138489},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.6121824383735657},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5669883489608765},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46923142671585083},{"id":"https://openalex.org/keywords/topological-sorting","display_name":"Topological sorting","score":0.4534088671207428},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.41342002153396606},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35166630148887634},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27337998151779175},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2139318883419037},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.122557133436203},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.08682382106781006}],"concepts":[{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.7172583341598511},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6398013234138489},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6121824383735657},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5669883489608765},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46923142671585083},{"id":"https://openalex.org/C176032523","wikidata":"https://www.wikidata.org/wiki/Q753127","display_name":"Topological sorting","level":3,"score":0.4534088671207428},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.41342002153396606},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35166630148887634},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27337998151779175},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2139318883419037},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.122557133436203},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.08682382106781006}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0020-0190(74)90001-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(74)90001-5","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1993449345","https://openalex.org/W2086502219","https://openalex.org/W2292996153","https://openalex.org/W2295268496","https://openalex.org/W2339337913","https://openalex.org/W2911980423"],"related_works":["https://openalex.org/W2487162673","https://openalex.org/W2942366970","https://openalex.org/W2793211469","https://openalex.org/W2949152769","https://openalex.org/W4372354731","https://openalex.org/W1692008701","https://openalex.org/W2597588799","https://openalex.org/W4360593462","https://openalex.org/W2562400057","https://openalex.org/W2194570607"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":7}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}