{"id":"https://openalex.org/W2045648565","doi":"https://doi.org/10.1016/0196-6774(87)90019-8","title":"Universal traversal sequences for paths and cycles","display_name":"Universal traversal sequences for paths and cycles","publication_year":1987,"publication_date":"1987-09-01","ids":{"openalex":"https://openalex.org/W2045648565","doi":"https://doi.org/10.1016/0196-6774(87)90019-8","mag":"2045648565"},"language":"en","primary_location":{"id":"doi:10.1016/0196-6774(87)90019-8","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0196-6774(87)90019-8","pdf_url":null,"source":{"id":"https://openalex.org/S110520077","display_name":"Journal of Algorithms","issn_l":"0196-6774","issn":["0196-6774","1090-2678"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319955","host_organization_name":"Academic Press","host_organization_lineage":["https://openalex.org/P4310319955","https://openalex.org/P4310320990"],"host_organization_lineage_names":["Academic Press","Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Algorithms","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/A5024791927","display_name":"Michael F. Bridgland","orcid":null},"institutions":[{"id":"https://openalex.org/I44896327","display_name":"Mitre (United States)","ror":"https://ror.org/03ks2a131","country_code":"US","type":"company","lineage":["https://openalex.org/I44896327"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Michael F Bridgland","raw_affiliation_strings":["The MITRE Corporation, Burlington Road, Bedford, Massachusetts 01730 USA","MITRE Corporation, Bedford, MA"],"affiliations":[{"raw_affiliation_string":"The MITRE Corporation, Burlington Road, Bedford, Massachusetts 01730 USA","institution_ids":["https://openalex.org/I44896327"]},{"raw_affiliation_string":"MITRE Corporation, Bedford, MA","institution_ids":["https://openalex.org/I44896327"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5024791927"],"corresponding_institution_ids":["https://openalex.org/I44896327"],"apc_list":null,"apc_paid":null,"fwci":2.6627,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.89435337,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"8","issue":"3","first_page":"395","last_page":"404"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9962999820709229,"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.9962999820709229,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9937000274658203,"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/T11567","display_name":"semigroups and automata theory","score":0.9925000071525574,"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.9267138242721558},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.7976635098457336},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7124444246292114},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6976282000541687},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.6902445554733276},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.6625176072120667},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.6486958861351013},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6315194964408875},{"id":"https://openalex.org/keywords/strongly-connected-component","display_name":"Strongly connected component","score":0.5396890640258789},{"id":"https://openalex.org/keywords/sort","display_name":"sort","score":0.5116139054298401},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4696989059448242},{"id":"https://openalex.org/keywords/connected-component","display_name":"Connected component","score":0.4677921235561371},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.359127938747406},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26709872484207153},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.12528139352798462}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.9267138242721558},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.7976635098457336},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7124444246292114},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6976282000541687},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.6902445554733276},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6625176072120667},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.6486958861351013},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6315194964408875},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.5396890640258789},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.5116139054298401},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4696989059448242},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.4677921235561371},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.359127938747406},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26709872484207153},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.12528139352798462},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0196-6774(87)90019-8","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0196-6774(87)90019-8","pdf_url":null,"source":{"id":"https://openalex.org/S110520077","display_name":"Journal of Algorithms","issn_l":"0196-6774","issn":["0196-6774","1090-2678"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319955","host_organization_name":"Academic Press","host_organization_lineage":["https://openalex.org/P4310319955","https://openalex.org/P4310320990"],"host_organization_lineage_names":["Academic Press","Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Algorithms","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":5,"referenced_works":["https://openalex.org/W1980967952","https://openalex.org/W1989887898","https://openalex.org/W2156184725","https://openalex.org/W2905110430","https://openalex.org/W6683138303"],"related_works":["https://openalex.org/W2200188075","https://openalex.org/W4230405657","https://openalex.org/W4254594467","https://openalex.org/W4252596799","https://openalex.org/W244044452","https://openalex.org/W4250225510","https://openalex.org/W1979520342","https://openalex.org/W2066086748","https://openalex.org/W2045648565","https://openalex.org/W4390189596"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}