{"id":"https://openalex.org/W4245497568","doi":"https://doi.org/10.1023/a:1025733107700","title":"Irredundant Algorithms for Traversing Directed Graphs: The Deterministic Case","display_name":"Irredundant Algorithms for Traversing Directed Graphs: The Deterministic Case","publication_year":2003,"publication_date":"2003-09-01","ids":{"openalex":"https://openalex.org/W4245497568","doi":"https://doi.org/10.1023/a:1025733107700"},"language":"en","primary_location":{"id":"doi:10.1023/a:1025733107700","is_oa":false,"landing_page_url":"https://doi.org/10.1023/a:1025733107700","pdf_url":null,"source":{"id":"https://openalex.org/S150218641","display_name":"Programming and Computer Software","issn_l":"0361-7688","issn":["0361-7688","1608-3261"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320267","host_organization_name":"Pleiades Publishing","host_organization_lineage":["https://openalex.org/P4310320267","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Pleiades Publishing","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Programming and Computer Software","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/A5025016186","display_name":"I. B. Bourdonov","orcid":"https://orcid.org/0000-0001-9539-7853"},"institutions":[{"id":"https://openalex.org/I4210101868","display_name":"Institute for System Programming","ror":"https://ror.org/017ef8252","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210101868","https://openalex.org/I4210124601"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"I. B. Bourdonov","raw_affiliation_strings":["Institute for System Programming, Russian Academy of Sciences, Bol'shaya Kommunisticheskaya, ul. 25, Moscow, 109004, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for System Programming, Russian Academy of Sciences, Bol'shaya Kommunisticheskaya, ul. 25, Moscow, 109004, Russia","institution_ids":["https://openalex.org/I4210101868"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052011212","display_name":"A. S. Kossatchev","orcid":"https://orcid.org/0000-0001-5316-3813"},"institutions":[{"id":"https://openalex.org/I4210101868","display_name":"Institute for System Programming","ror":"https://ror.org/017ef8252","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210101868","https://openalex.org/I4210124601"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"A. S. Kossatchev","raw_affiliation_strings":["Institute for System Programming, Russian Academy of Sciences, Bol'shaya Kommunisticheskaya, ul. 25, Moscow, 109004, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for System Programming, Russian Academy of Sciences, Bol'shaya Kommunisticheskaya, ul. 25, Moscow, 109004, Russia","institution_ids":["https://openalex.org/I4210101868"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025737715","display_name":"\u0412. \u0412. \u041a\u0443\u043b\u044f\u043c\u0438\u043d","orcid":"https://orcid.org/0000-0003-3439-9534"},"institutions":[{"id":"https://openalex.org/I4210101868","display_name":"Institute for System Programming","ror":"https://ror.org/017ef8252","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210101868","https://openalex.org/I4210124601"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"V. V. Kuliamin","raw_affiliation_strings":["Institute for System Programming, Russian Academy of Sciences, Bol'shaya Kommunisticheskaya, ul. 25, Moscow, 109004, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for System Programming, Russian Academy of Sciences, Bol'shaya Kommunisticheskaya, ul. 25, Moscow, 109004, Russia","institution_ids":["https://openalex.org/I4210101868"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3727,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.7059706,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"29","issue":"5","first_page":"245","last_page":"258"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.17579999566078186,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.17579999566078186,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.12449999898672104,"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.09809999912977219,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.8549718856811523},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.8308992981910706},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.8141252398490906},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.665641725063324},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.6381319761276245},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6191672682762146},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.6014810800552368},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5747089982032776},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.553347110748291},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5028621554374695},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.501044750213623},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.4947924017906189},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.4727809429168701},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.42648231983184814},{"id":"https://openalex.org/keywords/two-way-deterministic-finite-automaton","display_name":"Two-way deterministic finite automaton","score":0.4127289354801178},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.29263341426849365},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.27854228019714355},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.15263047814369202}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.8549718856811523},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.8308992981910706},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.8141252398490906},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.665641725063324},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.6381319761276245},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6191672682762146},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.6014810800552368},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5747089982032776},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.553347110748291},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5028621554374695},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.501044750213623},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.4947924017906189},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.4727809429168701},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.42648231983184814},{"id":"https://openalex.org/C139423837","wikidata":"https://www.wikidata.org/wiki/Q243800","display_name":"Two-way deterministic finite automaton","level":5,"score":0.4127289354801178},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.29263341426849365},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.27854228019714355},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.15263047814369202},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1023/a:1025733107700","is_oa":false,"landing_page_url":"https://doi.org/10.1023/a:1025733107700","pdf_url":null,"source":{"id":"https://openalex.org/S150218641","display_name":"Programming and Computer Software","issn_l":"0361-7688","issn":["0361-7688","1608-3261"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320267","host_organization_name":"Pleiades Publishing","host_organization_lineage":["https://openalex.org/P4310320267","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Pleiades Publishing","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Programming and Computer Software","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1503178494","https://openalex.org/W1514939953","https://openalex.org/W1534188278","https://openalex.org/W1577937387","https://openalex.org/W1760485725","https://openalex.org/W1972631373","https://openalex.org/W1979173175","https://openalex.org/W1998333922","https://openalex.org/W2005150099","https://openalex.org/W2008110774","https://openalex.org/W2009486458","https://openalex.org/W2054801208","https://openalex.org/W2064284095","https://openalex.org/W2080182237","https://openalex.org/W4256624975"],"related_works":["https://openalex.org/W2321527407","https://openalex.org/W185868636","https://openalex.org/W1990283467","https://openalex.org/W1849003752","https://openalex.org/W2408583837","https://openalex.org/W2404099564","https://openalex.org/W2091988401","https://openalex.org/W3135656023","https://openalex.org/W1486527429","https://openalex.org/W2080395144"],"abstract_inverted_index":null,"counts_by_year":[{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-06-19T15:47:20.252518","created_date":"2022-05-12T00:00:00"}