{"id":"https://openalex.org/W2026498915","doi":"https://doi.org/10.1145/1499586.1499704","title":"In search of the fastest algorithm","display_name":"In search of the fastest algorithm","publication_year":1973,"publication_date":"1973-01-01","ids":{"openalex":"https://openalex.org/W2026498915","doi":"https://doi.org/10.1145/1499586.1499704","mag":"2026498915"},"language":"en","primary_location":{"id":"doi:10.1145/1499586.1499704","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1499586.1499704","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the June 4-8, 1973, national computer conference and exposition on - AFIPS '73","raw_type":"proceedings-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/A5061696421","display_name":"Ian Munro","orcid":null},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Ian Munro","raw_affiliation_strings":["University of Waterloo, Waterloo, Ontario, CANADA"],"affiliations":[{"raw_affiliation_string":"University of Waterloo, Waterloo, Ontario, CANADA","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5061696421"],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.18186449,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"453","last_page":"453"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9984999895095825,"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.9984999895095825,"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.9940999746322632,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9940999746322632,"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/transitive-closure","display_name":"Transitive closure","score":0.7931860685348511},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7727586627006531},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.7678263783454895},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6037819385528564},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5603026747703552},{"id":"https://openalex.org/keywords/transitive-reduction","display_name":"Transitive reduction","score":0.5130318403244019},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5088194012641907},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4669331908226013},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.4420989453792572},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.44107481837272644},{"id":"https://openalex.org/keywords/lament","display_name":"Lament","score":0.43411946296691895},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.431644082069397},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4288892149925232},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.4192763864994049},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.4105423390865326},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33949458599090576},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2167777121067047},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.21549886465072632},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1471269428730011},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.11477991938591003},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.10708051919937134}],"concepts":[{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.7931860685348511},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7727586627006531},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.7678263783454895},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6037819385528564},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5603026747703552},{"id":"https://openalex.org/C129691609","wikidata":"https://www.wikidata.org/wiki/Q3088151","display_name":"Transitive reduction","level":5,"score":0.5130318403244019},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5088194012641907},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4669331908226013},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.4420989453792572},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44107481837272644},{"id":"https://openalex.org/C2779421831","wikidata":"https://www.wikidata.org/wiki/Q1471717","display_name":"Lament","level":2,"score":0.43411946296691895},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.431644082069397},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4288892149925232},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.4192763864994049},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.4105423390865326},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33949458599090576},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2167777121067047},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.21549886465072632},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1471269428730011},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.11477991938591003},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.10708051919937134},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1499586.1499704","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1499586.1499704","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the June 4-8, 1973, national computer conference and exposition on - AFIPS '73","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W198808598","https://openalex.org/W2044040096","https://openalex.org/W3139713485","https://openalex.org/W4297054060","https://openalex.org/W2021661549","https://openalex.org/W2171308818","https://openalex.org/W1578808377","https://openalex.org/W2020284609","https://openalex.org/W189043490","https://openalex.org/W2069149254"],"abstract_inverted_index":{"Problems":[0],"from":[1],"many":[2,99],"disciplines":[3],"are":[4,71],"frequently":[5],"reduced":[6],"to":[7,19,57,66,127,131],"graph":[8,21],"theoretic":[9],"questions.":[10],"This":[11,95],"leaves":[12],"the":[13,20,51,78,91],"challenge":[14],"of":[15,35,50,80,93,119],"finding":[16],"a":[17,47,61],"solution":[18],"problem":[22],"as":[23,26],"efficiently":[24],"(cheaply)":[25],"possible.":[27],"We":[28,111],"will":[29,112],"discuss":[30,113],"techniques":[31],"by":[32],"which":[33,69,86],"some":[34],"these":[36,120],"questions":[37],"may":[38],"be":[39],"answered":[40],"in":[41,77,90,104],"what":[42],"is":[43],"more":[44],"or":[45,130],"less":[46],"single":[48],"scan":[49],"input.":[52],"Our":[53],"attention":[54],"then":[55],"turns":[56],"problems":[58,67,121],"that":[59,64],"seem":[60],"little":[62],"harder;":[63],"is,":[65],"for":[68,117],"there":[70],"trivially":[72],"algorithms":[73,85,116],"taking":[74],"time":[75,88],"polynomial":[76],"amount":[79,92],"input,":[81],"but":[82],"no":[83],"known":[84],"take":[87],"linear":[89],"data.":[94],"class":[96],"includes,":[97],"among":[98],"other":[100],"problems,":[101],"maximum":[102],"matching":[103],"bipartite":[105],"graphs":[106],"and":[107,122],"digraph":[108],"transitive":[109],"closure.":[110],"surprisingly":[114],"fast":[115],"certain":[118],"lament":[123],"our":[124],"inability":[125],"either":[126],"do":[128,135],"better":[129],"prove":[132],"we":[133],"cannot":[134],"better.":[136]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}