{"id":"https://openalex.org/W3138718979","doi":"https://doi.org/10.1007/bf01530925","title":"A data structure for arc insertion and regular path finding","display_name":"A data structure for arc insertion and regular path finding","publication_year":1991,"publication_date":"1991-06-01","ids":{"openalex":"https://openalex.org/W3138718979","doi":"https://doi.org/10.1007/bf01530925","mag":"3138718979"},"language":"en","primary_location":{"id":"doi:10.1007/bf01530925","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01530925","pdf_url":null,"source":{"id":"https://openalex.org/S90199469","display_name":"Annals of Mathematics and Artificial Intelligence","issn_l":"1012-2443","issn":["1012-2443","1573-7470"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Mathematics and Artificial Intelligence","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/A5111424583","display_name":"Adam L. Buchsbaum","orcid":null},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Adam L. Buchsbaum","raw_affiliation_strings":["Department of Computer Science, Princeton University, 08544, Princeton, NJ, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Princeton University, 08544, Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110195580","display_name":"Paris C. Kanellakis","orcid":null},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Paris C. Kanellakis","raw_affiliation_strings":["Department of Computer Science, Brown University, 02912, Providence, RI, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Brown University, 02912, Providence, RI, USA","institution_ids":["https://openalex.org/I27804330"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003340402","display_name":"Jeffrey Scott Vitter","orcid":"https://orcid.org/0000-0001-7970-6118"},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jeffrey Scott Vitter","raw_affiliation_strings":["Department of Computer Science, Brown University, 02912, Providence, RI, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Brown University, 02912, Providence, RI, USA","institution_ids":["https://openalex.org/I27804330"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5111424583"],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.5383,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.77751405,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"3","issue":"2-4","first_page":"187","last_page":"210"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9984999895095825,"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"}},"topics":[{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9984999895095825,"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/T10142","display_name":"Formal Methods in Verification","score":0.9972000122070312,"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.9958000183105469,"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/data-structure","display_name":"Data structure","score":0.7027510404586792},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6979005336761475},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.66124427318573},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.555754542350769},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5494869351387024},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4732773005962372},{"id":"https://openalex.org/keywords/amortized-analysis","display_name":"Amortized analysis","score":0.462159663438797},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4524742662906647},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44248074293136597},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.42900556325912476},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3940353989601135},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3588079810142517},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33206120133399963},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.2203383445739746},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09842944145202637}],"concepts":[{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.7027510404586792},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6979005336761475},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.66124427318573},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.555754542350769},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5494869351387024},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4732773005962372},{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.462159663438797},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4524742662906647},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44248074293136597},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.42900556325912476},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3940353989601135},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3588079810142517},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33206120133399963},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.2203383445739746},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09842944145202637}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf01530925","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01530925","pdf_url":null,"source":{"id":"https://openalex.org/S90199469","display_name":"Annals of Mathematics and Artificial Intelligence","issn_l":"1012-2443","issn":["1012-2443","1573-7470"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Mathematics and Artificial Intelligence","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":16,"referenced_works":["https://openalex.org/W1551066637","https://openalex.org/W1570025952","https://openalex.org/W1655990431","https://openalex.org/W1976177462","https://openalex.org/W1987927249","https://openalex.org/W2012812544","https://openalex.org/W2029556592","https://openalex.org/W2030166143","https://openalex.org/W2037034819","https://openalex.org/W2043190038","https://openalex.org/W2069294703","https://openalex.org/W2093117456","https://openalex.org/W2119179558","https://openalex.org/W2132063146","https://openalex.org/W2164299311","https://openalex.org/W4255993952"],"related_works":["https://openalex.org/W2146569528","https://openalex.org/W8290509","https://openalex.org/W2184537587","https://openalex.org/W4287028074","https://openalex.org/W2106828717","https://openalex.org/W3191289342","https://openalex.org/W1998712144","https://openalex.org/W4300165677","https://openalex.org/W4297817344","https://openalex.org/W4292730466"],"abstract_inverted_index":null,"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}