{"id":"https://openalex.org/W2480811457","doi":"https://doi.org/10.1007/3-540-55121-2_19","title":"Complete problems for logspace involving lexicographic first paths in graphs","display_name":"Complete problems for logspace involving lexicographic first paths in graphs","publication_year":1992,"publication_date":"1992-01-01","ids":{"openalex":"https://openalex.org/W2480811457","doi":"https://doi.org/10.1007/3-540-55121-2_19","mag":"2480811457"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-55121-2_19","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-55121-2_19","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/A5061350983","display_name":"Iain A. Stewart","orcid":"https://orcid.org/0000-0002-0752-1971"},"institutions":[{"id":"https://openalex.org/I84884186","display_name":"Newcastle University","ror":"https://ror.org/01kj2bm70","country_code":"GB","type":"education","lineage":["https://openalex.org/I84884186"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Iain A. Stewart","raw_affiliation_strings":["Computing Laboratory, University of Newcastle upon Tyne, Claremont Tower, Claremont Road, NE1 7RU, Newcastle upon Tyne, England"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computing Laboratory, University of Newcastle upon Tyne, Claremont Tower, Claremont Road, NE1 7RU, Newcastle upon Tyne, England","institution_ids":["https://openalex.org/I84884186"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5061350983"],"corresponding_institution_ids":["https://openalex.org/I84884186"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.6443,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.67955801,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"198","last_page":"208"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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.9993000030517578,"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.993399977684021,"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/lexicographical-order","display_name":"Lexicographical order","score":0.8929947018623352},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6461783647537231},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5647500157356262},{"id":"https://openalex.org/keywords/decision-problem","display_name":"Decision problem","score":0.49551570415496826},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48209813237190247},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.47819092869758606},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.47608843445777893},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.46207478642463684},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4414888918399811},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4079853594303131},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4022623300552368},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.20487064123153687},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.188257098197937}],"concepts":[{"id":"https://openalex.org/C159254197","wikidata":"https://www.wikidata.org/wiki/Q1144915","display_name":"Lexicographical order","level":2,"score":0.8929947018623352},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6461783647537231},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5647500157356262},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.49551570415496826},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48209813237190247},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.47819092869758606},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.47608843445777893},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.46207478642463684},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4414888918399811},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4079853594303131},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4022623300552368},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.20487064123153687},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.188257098197937},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/3-540-55121-2_19","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-55121-2_19","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:hdl:10068/650565","is_oa":false,"landing_page_url":"http://hdl.handle.net/10068/650565","pdf_url":null,"source":{"id":"https://openalex.org/S4377196900","display_name":"OpenGrey (Institut de l'Information Scientifique et Technique)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1295345811","host_organization_name":"Institut de l'Information Scientifique et Technique","host_organization_lineage":["https://openalex.org/I1295345811"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"R - Report"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7099999785423279,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W189149083","https://openalex.org/W1498460077","https://openalex.org/W1523888442","https://openalex.org/W1801334096","https://openalex.org/W1970629906","https://openalex.org/W1990870868","https://openalex.org/W2011039300","https://openalex.org/W2017205387","https://openalex.org/W2043360684","https://openalex.org/W2045583484","https://openalex.org/W2081298180","https://openalex.org/W2093779107","https://openalex.org/W2136273331","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2526180610","https://openalex.org/W2082494488","https://openalex.org/W2998116189","https://openalex.org/W2054349495","https://openalex.org/W2081358954","https://openalex.org/W2964314221","https://openalex.org/W2554461497","https://openalex.org/W4301521638","https://openalex.org/W2269982198","https://openalex.org/W3006501763"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}