{"id":"https://openalex.org/W296798544","doi":"https://doi.org/10.1145/1714450.1714451","title":"Logspace Reduction of Directed Reachability for Bounded Genus Graphs to the Planar Case","display_name":"Logspace Reduction of Directed Reachability for Bounded Genus Graphs to the Planar Case","alternate_titles":[],"publication_year":2010,"publication_date":"2010-03-01","ids":{"openalex":"https://openalex.org/W296798544","doi":"https://doi.org/10.1145/1714450.1714451","mag":"296798544"},"language":"en","primary_location":{"id":"doi:10.1145/1714450.1714451","doi":"https://doi.org/10.1145/1714450.1714451","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1714450.1714451","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","dongbi-c","jufo-1","norway-1","poland-70","russia-white-list-3"],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W296798544"],"child_works_count":0,"type":"article","is_traditional":true,"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/A5068937030","display_name":"Jan Kyn\u010dl","orcid":"https://orcid.org/0000-0003-4908-4703","observed_orcids":["https://orcid.org/0000-0003-4908-4703"]},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Jan Kyn\u010dl","raw_affiliation_strings":["Charles University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Charles University","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043504519","display_name":"Tom\u00e1\u0161 Vysko\u010dil","orcid":"https://orcid.org/0000-0003-1256-6151","observed_orcids":["https://orcid.org/0000-0003-1256-6151"]},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Tom\u00e1\u0161 Vysko\u010dil","raw_affiliation_strings":["Charles University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Charles University","institution_ids":["https://openalex.org/I21250087"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I21250087"],"apc_list":null,"apc_paid":null,"fwci":2.5714,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.8794836,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":86,"max":96},"biblio":{"volume":"1","issue":"3","first_page":"1","last_page":"11"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.5268999934196472,"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.5268999934196472,"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.4713999927043915,"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.0003000000142492354,"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/bounded-genus-graphs","display_name":"bounded genus graphs","score":0.9010000228881836},{"id":"https://openalex.org/keywords/nl","display_name":"NL","score":0.38199999928474426},{"id":"https://openalex.org/keywords/l","display_name":"L","score":0.4050000011920929},{"id":"https://openalex.org/keywords/nl-completeness","display_name":"NL-completeness","score":0.6869999766349792},{"id":"https://openalex.org/keywords/torus","display_name":"torus","score":0.4699999988079071}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9351860880851746},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6959003806114197},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.626473069190979},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5815585851669312},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.5547910928726196},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5426313281059265},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5199043154716492},{"id":"https://openalex.org/C129691609","wikidata":"https://www.wikidata.org/wiki/Q3088151","display_name":"Transitive reduction","level":5,"score":0.4821286201477051},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4559933841228485},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.44478991627693176},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.12289077043533325},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.06998392939567566},{"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.1145/1714450.1714451","doi":"https://doi.org/10.1145/1714450.1714451","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1714450.1714451","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","dongbi-c","jufo-1","norway-1","poland-70","russia-white-list-3"],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},{"id":"mag:296798544","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc16.html#KynclV09","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W73159664","https://openalex.org/W1487861088","https://openalex.org/W1535347174","https://openalex.org/W2014352902","https://openalex.org/W2028753111","https://openalex.org/W2049516232","https://openalex.org/W2072560800","https://openalex.org/W2163153241","https://openalex.org/W2170716479"],"related_works":["https://openalex.org/W31012878","https://openalex.org/W1590224955","https://openalex.org/W2072560800","https://openalex.org/W2014352902","https://openalex.org/W7098514846","https://openalex.org/W2399577022","https://openalex.org/W2170716479","https://openalex.org/W206903853","https://openalex.org/W2397721975","https://openalex.org/W1998473998"],"abstract_inverted_index":{"Directed":[0,38],"reachability":[1,39,51,59,68,95],"(or":[2],"briefly":[3],"reachability)":[4],"is":[5,27,40,52,65,69,74,79,102],"the":[6,46,58,62,100,105],"following":[7],"decision":[8],"problem:":[9],"given":[10],"a":[11,28,41,116],"directed":[12,29],"graph":[13,64],"G":[14,36],"and":[15,73],"two":[16],"of":[17,57,119],"its":[18],"vertices":[19],"s":[20,32],",":[21,23],"t":[22,34],"determine":[24],"whether":[25],"there":[26],"path":[30],"from":[31],"to":[33,82,104,112],"in":[35,76,87],".":[37],"standard":[42],"complete":[43],"problem":[44],"for":[45,71,96],"complexity":[47],"class":[48],"NL.":[49],"Planar":[50,67],"an":[53],"important":[54],"restricted":[55],"version":[56],"problem,":[60],"where":[61],"input":[63],"planar.":[66],"hard":[70],"L":[72],"contained":[75,86],"NL":[77],"but":[78],"not":[80],"known":[81],"be":[83],"NL-complete":[84],"or":[85],"L.":[88],"Allender":[89],"et":[90],"al.":[91],"[2009]":[92],"showed":[93],"that":[94],"graphs":[97,113],"embedded":[98,114],"on":[99,115],"torus":[101],"logspace-reducible":[103],"planar":[106],"case.":[107],"We":[108],"generalize":[109],"this":[110],"result":[111],"fixed":[117],"surface":[118],"arbitrary":[120],"genus.":[121]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W296798544","counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
