{"id":"https://openalex.org/W1949482742","doi":"https://doi.org/10.1007/3-540-61680-2_67","title":"Negative-cycle detection algorithms","display_name":"Negative-cycle detection algorithms","publication_year":1996,"publication_date":"1996-01-01","ids":{"openalex":"https://openalex.org/W1949482742","doi":"https://doi.org/10.1007/3-540-61680-2_67","mag":"1949482742"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-61680-2_67","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-61680-2_67","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5045036830","display_name":"Boris V. Cherkassky","orcid":null},"institutions":[{"id":"https://openalex.org/I2802368776","display_name":"Central Economics and Mathematics Institute","ror":"https://ror.org/02n937p61","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I2802368776","https://openalex.org/I4210120228"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Boris V. Cherkassky","raw_affiliation_strings":["Central Economics and Mathematics Institute, Krasikova St. 32, 117418, Moscow, Russia","Central Economics & Mathematics Institute"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Central Economics and Mathematics Institute, Krasikova St. 32, 117418, Moscow, Russia","institution_ids":["https://openalex.org/I2802368776"]},{"raw_affiliation_string":"Central Economics & Mathematics Institute","institution_ids":["https://openalex.org/I2802368776"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111783338","display_name":"Andrew V. Goldberg","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":false,"raw_author_name":"Andrew V. Goldberg","raw_affiliation_strings":["NEC Research Institute, Inc., 4 Independence Way, 08540, Princeton, NJ","Princeton University, Princeton, United States"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NEC Research Institute, Inc., 4 Independence Way, 08540, Princeton, NJ","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Princeton University, Princeton, United States","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.1727,"has_fulltext":false,"cited_by_count":53,"citation_normalized_percentile":{"value":0.80784844,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"349","last_page":"363"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9951000213623047,"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/T10799","display_name":"Data Visualization and Analytics","score":0.9866999983787537,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/shortest-path-problem","display_name":"Shortest path problem","score":0.7580664157867432},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.697502851486206},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5712551474571228},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5395824313163757},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.43526238203048706},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.4181673228740692},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.4148518443107605},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.313387393951416},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.17430183291435242},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.07687661051750183}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7580664157867432},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.697502851486206},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5712551474571228},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5395824313163757},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.43526238203048706},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.4181673228740692},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.4148518443107605},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.313387393951416},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.17430183291435242},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.07687661051750183},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/3-540-61680-2_67","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-61680-2_67","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.4.488","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.488","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.avglab.com/andrew/./pub/neci-tr-96-029.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1426993502","https://openalex.org/W1500012667","https://openalex.org/W1513400187","https://openalex.org/W1561880747","https://openalex.org/W1964119857","https://openalex.org/W1964416868","https://openalex.org/W1968198624","https://openalex.org/W1985882632","https://openalex.org/W1996805805","https://openalex.org/W2034710274","https://openalex.org/W2036030013","https://openalex.org/W2061159212","https://openalex.org/W2061632451","https://openalex.org/W2062266989","https://openalex.org/W2065474496","https://openalex.org/W2069916913","https://openalex.org/W2125690626","https://openalex.org/W2164141517","https://openalex.org/W2166541787","https://openalex.org/W2227557434","https://openalex.org/W2752885492","https://openalex.org/W3015760390","https://openalex.org/W3113130260","https://openalex.org/W3138807513","https://openalex.org/W4285719527","https://openalex.org/W6724006179","https://openalex.org/W7029321148"],"related_works":["https://openalex.org/W4223969905","https://openalex.org/W2363342665","https://openalex.org/W2578319993","https://openalex.org/W2379804627","https://openalex.org/W2170980056","https://openalex.org/W2359532380","https://openalex.org/W2886722595","https://openalex.org/W2990531685","https://openalex.org/W4310124294","https://openalex.org/W2373384475"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}